./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:31:13,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:31:13,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:31:13,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:31:13,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:31:13,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:31:13,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:31:13,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:31:13,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:31:13,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:31:13,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:31:13,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:31:13,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:31:13,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:31:13,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:31:13,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:31:13,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:31:13,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:31:13,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:31:13,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:31:13,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:31:13,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:31:13,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:31:13,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:31:13,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:31:13,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:31:13,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:31:13,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:31:13,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:31:13,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:31:13,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:31:13,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:31:13,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:31:13,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:31:13,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:31:13,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:31:13,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:31:13,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:31:13,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:31:13,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:31:13,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:31:13,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:31:13,343 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:31:13,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:31:13,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:31:13,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:31:13,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:31:13,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:31:13,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:31:13,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:31:13,346 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:31:13,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:31:13,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:31:13,347 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:31:13,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:31:13,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:31:13,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:31:13,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:31:13,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:31:13,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:31:13,348 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:31:13,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:31:13,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:31:13,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:31:13,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:31:13,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:31:13,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:31:13,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:31:13,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:13,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:31:13,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:31:13,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:31:13,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:31:13,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:31:13,351 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:31:13,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:31:13,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:31:13,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2022-11-20 10:31:13,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:31:13,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:31:13,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:31:13,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:31:13,743 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:31:13,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-11-20 10:31:16,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:31:17,027 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:31:17,028 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-11-20 10:31:17,034 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/data/7d7cd2421/4231c28d7b0944d08b8b1098441c29c1/FLAG605bd3cee [2022-11-20 10:31:17,048 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/data/7d7cd2421/4231c28d7b0944d08b8b1098441c29c1 [2022-11-20 10:31:17,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:31:17,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:31:17,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:17,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:31:17,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:31:17,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63810c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17, skipping insertion in model container [2022-11-20 10:31:17,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:31:17,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:31:17,310 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-11-20 10:31:17,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:17,341 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:31:17,353 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-11-20 10:31:17,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:17,376 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:31:17,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17 WrapperNode [2022-11-20 10:31:17,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:17,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:17,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:31:17,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:31:17,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,422 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-11-20 10:31:17,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:17,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:31:17,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:31:17,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:31:17,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,443 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:31:17,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:31:17,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:31:17,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:31:17,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (1/1) ... [2022-11-20 10:31:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:17,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:17,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:31:17,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:31:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:31:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:31:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:31:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:31:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-11-20 10:31:17,516 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-11-20 10:31:17,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:31:17,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:31:17,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:31:17,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:31:17,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 10:31:17,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 10:31:17,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:31:17,647 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:31:17,651 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:31:17,993 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:31:18,008 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:31:18,016 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:31:18,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:18 BoogieIcfgContainer [2022-11-20 10:31:18,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:31:18,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:31:18,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:31:18,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:31:18,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:31:17" (1/3) ... [2022-11-20 10:31:18,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693cb831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:31:18, skipping insertion in model container [2022-11-20 10:31:18,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:17" (2/3) ... [2022-11-20 10:31:18,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693cb831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:31:18, skipping insertion in model container [2022-11-20 10:31:18,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:18" (3/3) ... [2022-11-20 10:31:18,033 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-11-20 10:31:18,054 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:31:18,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-20 10:31:18,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:31:18,136 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a61c5d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:31:18,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 10:31:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 10:31:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:31:18,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:18,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:18,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1346921732, now seen corresponding path program 1 times [2022-11-20 10:31:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:18,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016587651] [2022-11-20 10:31:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:18,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:18,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016587651] [2022-11-20 10:31:18,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016587651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:18,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:18,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:31:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690980967] [2022-11-20 10:31:18,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:18,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:31:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:31:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:31:18,403 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:31:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:18,435 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-11-20 10:31:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:31:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-20 10:31:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:18,445 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:31:18,445 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 10:31:18,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:31:18,455 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:18,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:31:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 10:31:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-20 10:31:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 10:31:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-20 10:31:18,495 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 16 [2022-11-20 10:31:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:18,496 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-20 10:31:18,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:31:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-20 10:31:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:31:18,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:18,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:18,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:31:18,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1031497992, now seen corresponding path program 1 times [2022-11-20 10:31:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:18,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982729721] [2022-11-20 10:31:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:31:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:18,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982729721] [2022-11-20 10:31:18,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982729721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:18,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:18,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:31:18,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398208123] [2022-11-20 10:31:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:18,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:18,652 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:31:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:18,676 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-11-20 10:31:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:18,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-11-20 10:31:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:18,678 INFO L225 Difference]: With dead ends: 35 [2022-11-20 10:31:18,678 INFO L226 Difference]: Without dead ends: 34 [2022-11-20 10:31:18,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:31:18,680 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:18,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:31:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-20 10:31:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-20 10:31:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 10:31:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-20 10:31:18,700 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 16 [2022-11-20 10:31:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:18,702 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-20 10:31:18,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:31:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-20 10:31:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:31:18,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:18,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:18,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:31:18,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1911666638, now seen corresponding path program 1 times [2022-11-20 10:31:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:18,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745981577] [2022-11-20 10:31:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:18,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745981577] [2022-11-20 10:31:18,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745981577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:18,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381475621] [2022-11-20 10:31:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:18,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:18,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:18,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:18,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:31:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:31:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:19,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:19,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381475621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:19,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:19,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-20 10:31:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681024655] [2022-11-20 10:31:19,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:31:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:31:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:31:19,294 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:31:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:19,385 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-20 10:31:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2022-11-20 10:31:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:19,390 INFO L225 Difference]: With dead ends: 34 [2022-11-20 10:31:19,392 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 10:31:19,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:19,395 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:19,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 98 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 10:31:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-20 10:31:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 10:31:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-20 10:31:19,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-11-20 10:31:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:19,414 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-20 10:31:19,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:31:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-20 10:31:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 10:31:19,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:19,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:19,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:19,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:19,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 551123241, now seen corresponding path program 1 times [2022-11-20 10:31:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:19,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850650486] [2022-11-20 10:31:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:31:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:19,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850650486] [2022-11-20 10:31:19,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850650486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:19,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:19,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:31:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993796326] [2022-11-20 10:31:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:31:19,956 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:31:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:20,016 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-11-20 10:31:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:20,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-11-20 10:31:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:20,018 INFO L225 Difference]: With dead ends: 49 [2022-11-20 10:31:20,019 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 10:31:20,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:31:20,020 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:20,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:31:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 10:31:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-11-20 10:31:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:31:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-20 10:31:20,029 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-11-20 10:31:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,030 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-20 10:31:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:31:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-20 10:31:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 10:31:20,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:20,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:31:20,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash 551123433, now seen corresponding path program 1 times [2022-11-20 10:31:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613866487] [2022-11-20 10:31:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:31:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:20,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613866487] [2022-11-20 10:31:20,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613866487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:20,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:20,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:31:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318348904] [2022-11-20 10:31:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:20,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:31:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:31:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:20,162 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:31:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:20,253 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-11-20 10:31:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:31:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-11-20 10:31:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:20,256 INFO L225 Difference]: With dead ends: 44 [2022-11-20 10:31:20,256 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 10:31:20,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:31:20,259 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:20,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 10:31:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-20 10:31:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.206896551724138) internal successors, (35), 32 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:31:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-11-20 10:31:20,281 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 33 [2022-11-20 10:31:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,283 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-11-20 10:31:20,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:31:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-11-20 10:31:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 10:31:20,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:20,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:31:20,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash -95042683, now seen corresponding path program 1 times [2022-11-20 10:31:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380251379] [2022-11-20 10:31:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:31:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:20,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380251379] [2022-11-20 10:31:20,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380251379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:20,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:20,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:31:20,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106552830] [2022-11-20 10:31:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:20,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:31:20,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:31:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:31:20,464 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:31:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:20,565 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-11-20 10:31:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:31:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-11-20 10:31:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:20,568 INFO L225 Difference]: With dead ends: 45 [2022-11-20 10:31:20,569 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 10:31:20,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:31:20,571 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:20,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 171 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 10:31:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-11-20 10:31:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:31:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-20 10:31:20,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2022-11-20 10:31:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:20,587 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-20 10:31:20,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:31:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-20 10:31:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:31:20,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:20,591 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:20,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:31:20,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:20,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1626861010, now seen corresponding path program 1 times [2022-11-20 10:31:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360106418] [2022-11-20 10:31:20,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:20,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:20,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360106418] [2022-11-20 10:31:20,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360106418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:20,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349498847] [2022-11-20 10:31:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:20,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:20,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:20,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:20,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:31:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:20,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:20,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:20,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:21,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349498847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:21,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:21,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-20 10:31:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305320286] [2022-11-20 10:31:21,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:21,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 10:31:21,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:31:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:31:21,092 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-20 10:31:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:21,401 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-11-20 10:31:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:31:21,401 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 50 [2022-11-20 10:31:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:21,403 INFO L225 Difference]: With dead ends: 87 [2022-11-20 10:31:21,403 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 10:31:21,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2022-11-20 10:31:21,404 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 119 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:21,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 229 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 10:31:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-11-20 10:31:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.25) internal successors, (65), 55 states have internal predecessors, (65), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:31:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-11-20 10:31:21,415 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 50 [2022-11-20 10:31:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:21,415 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-11-20 10:31:21,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-20 10:31:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-11-20 10:31:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:31:21,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:21,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:21,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 10:31:21,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:21,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1106916314, now seen corresponding path program 1 times [2022-11-20 10:31:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:21,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024326381] [2022-11-20 10:31:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:21,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024326381] [2022-11-20 10:31:21,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024326381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:21,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054713696] [2022-11-20 10:31:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:21,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:21,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:21,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:21,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:31:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:21,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:21,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:22,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:22,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054713696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:22,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:22,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-11-20 10:31:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879916482] [2022-11-20 10:31:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:22,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:31:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:31:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:31:22,015 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 10:31:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:22,124 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-11-20 10:31:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:31:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-11-20 10:31:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:22,126 INFO L225 Difference]: With dead ends: 76 [2022-11-20 10:31:22,126 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 10:31:22,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:31:22,128 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:22,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 10:31:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-20 10:31:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:31:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2022-11-20 10:31:22,138 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 51 [2022-11-20 10:31:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:22,139 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2022-11-20 10:31:22,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 10:31:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-11-20 10:31:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:31:22,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:22,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:22,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:22,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:31:22,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1106922272, now seen corresponding path program 1 times [2022-11-20 10:31:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:22,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922208240] [2022-11-20 10:31:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:22,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922208240] [2022-11-20 10:31:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922208240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173087561] [2022-11-20 10:31:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:22,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:22,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:22,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:31:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:22,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:31:22,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:22,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 10:31:22,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173087561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:22,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:22,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-11-20 10:31:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434222008] [2022-11-20 10:31:22,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:22,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 10:31:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 10:31:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:31:22,912 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-20 10:31:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:23,232 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2022-11-20 10:31:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:31:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 51 [2022-11-20 10:31:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:23,234 INFO L225 Difference]: With dead ends: 78 [2022-11-20 10:31:23,234 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:31:23,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 10:31:23,235 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:23,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 323 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:31:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-20 10:31:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 18 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 10:31:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-11-20 10:31:23,245 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 51 [2022-11-20 10:31:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:23,246 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-11-20 10:31:23,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-20 10:31:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-11-20 10:31:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 10:31:23,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:23,248 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:23,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:23,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:23,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1638655593, now seen corresponding path program 2 times [2022-11-20 10:31:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:23,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900170777] [2022-11-20 10:31:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:31:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:31:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:31:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:31:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:31:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-20 10:31:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:23,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900170777] [2022-11-20 10:31:23,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900170777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:23,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146960680] [2022-11-20 10:31:23,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:23,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:23,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:31:24,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:24,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:24,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 10:31:24,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-20 10:31:24,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-20 10:31:24,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146960680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:24,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:24,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-11-20 10:31:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125340463] [2022-11-20 10:31:24,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 10:31:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 10:31:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2022-11-20 10:31:24,567 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-20 10:31:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:25,315 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-11-20 10:31:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-20 10:31:25,316 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 101 [2022-11-20 10:31:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:25,318 INFO L225 Difference]: With dead ends: 151 [2022-11-20 10:31:25,318 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 10:31:25,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=986, Invalid=3046, Unknown=0, NotChecked=0, Total=4032 [2022-11-20 10:31:25,320 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 383 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:25,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 353 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:31:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 10:31:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 139. [2022-11-20 10:31:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.12) internal successors, (112), 101 states have internal predecessors, (112), 36 states have call successors, (36), 13 states have call predecessors, (36), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-20 10:31:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2022-11-20 10:31:25,345 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 101 [2022-11-20 10:31:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:25,346 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2022-11-20 10:31:25,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 24 states have internal predecessors, (77), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-20 10:31:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-11-20 10:31:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-20 10:31:25,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:25,356 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:25,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:25,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:31:25,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 269196873, now seen corresponding path program 3 times [2022-11-20 10:31:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317729453] [2022-11-20 10:31:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:31:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:31:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:31:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:31:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:31:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:31:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:31:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 10:31:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 10:31:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:31:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 10:31:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:31:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 10:31:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 475 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-11-20 10:31:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:27,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317729453] [2022-11-20 10:31:27,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317729453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:27,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593053633] [2022-11-20 10:31:27,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:31:27,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:27,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:27,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:31:27,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-11-20 10:31:27,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:27,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 10:31:27,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-11-20 10:31:27,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2022-11-20 10:31:28,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593053633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:28,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:28,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2022-11-20 10:31:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617850566] [2022-11-20 10:31:28,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:28,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 10:31:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 10:31:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 10:31:28,206 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-20 10:31:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:31,492 INFO L93 Difference]: Finished difference Result 307 states and 381 transitions. [2022-11-20 10:31:31,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-11-20 10:31:31,493 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 203 [2022-11-20 10:31:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:31,496 INFO L225 Difference]: With dead ends: 307 [2022-11-20 10:31:31,496 INFO L226 Difference]: Without dead ends: 306 [2022-11-20 10:31:31,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5493 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4130, Invalid=14776, Unknown=0, NotChecked=0, Total=18906 [2022-11-20 10:31:31,504 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1199 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:31,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 744 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:31:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-20 10:31:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 255. [2022-11-20 10:31:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.1404494382022472) internal successors, (203), 178 states have internal predecessors, (203), 74 states have call successors, (74), 26 states have call predecessors, (74), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-20 10:31:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2022-11-20 10:31:31,548 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 203 [2022-11-20 10:31:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2022-11-20 10:31:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.5) internal successors, (110), 32 states have internal predecessors, (110), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-20 10:31:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2022-11-20 10:31:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-20 10:31:31,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:31,555 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:31,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:31,763 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1401050065, now seen corresponding path program 1 times [2022-11-20 10:31:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007025702] [2022-11-20 10:31:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:31:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:31:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:31:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:31:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:31:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:31:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:31:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 10:31:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 10:31:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:31:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 10:31:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:31:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 10:31:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-20 10:31:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-20 10:31:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 10:31:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-20 10:31:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-11-20 10:31:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:33,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007025702] [2022-11-20 10:31:33,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007025702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:33,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066330164] [2022-11-20 10:31:33,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:33,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:33,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:33,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:33,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:31:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:33,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-20 10:31:33,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-11-20 10:31:34,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2022-11-20 10:31:35,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066330164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:35,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:35,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 76 [2022-11-20 10:31:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285606641] [2022-11-20 10:31:35,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:35,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 10:31:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:35,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 10:31:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=4801, Unknown=0, NotChecked=0, Total=5852 [2022-11-20 10:31:35,580 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) [2022-11-20 10:31:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:38,560 INFO L93 Difference]: Finished difference Result 544 states and 706 transitions. [2022-11-20 10:31:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-20 10:31:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) Word has length 237 [2022-11-20 10:31:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:38,566 INFO L225 Difference]: With dead ends: 544 [2022-11-20 10:31:38,567 INFO L226 Difference]: Without dead ends: 543 [2022-11-20 10:31:38,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6403 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5207, Invalid=16549, Unknown=0, NotChecked=0, Total=21756 [2022-11-20 10:31:38,574 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 972 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:38,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 670 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:31:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-20 10:31:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 515. [2022-11-20 10:31:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 360 states have internal predecessors, (411), 152 states have call successors, (152), 52 states have call predecessors, (152), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-11-20 10:31:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 665 transitions. [2022-11-20 10:31:38,637 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 665 transitions. Word has length 237 [2022-11-20 10:31:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:38,638 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 665 transitions. [2022-11-20 10:31:38,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 52 states have internal predecessors, (167), 26 states have call successors, (77), 26 states have call predecessors, (77), 1 states have return successors, (52), 26 states have call predecessors, (52), 26 states have call successors, (52) [2022-11-20 10:31:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 665 transitions. [2022-11-20 10:31:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2022-11-20 10:31:38,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:38,652 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:38,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:38,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:31:38,859 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:31:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 255499764, now seen corresponding path program 2 times [2022-11-20 10:31:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:38,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65913810] [2022-11-20 10:31:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:31:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:31:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:31:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:31:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:31:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:31:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:31:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:31:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:31:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:31:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:31:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:31:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:31:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:31:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:31:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 10:31:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 10:31:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:31:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 10:31:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:31:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:31:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 10:31:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:31:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:31:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-20 10:31:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-20 10:31:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 10:31:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-20 10:31:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-20 10:31:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-20 10:31:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-20 10:31:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-20 10:31:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-11-20 10:31:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-11-20 10:31:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-20 10:31:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-20 10:31:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-20 10:31:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-20 10:31:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-20 10:31:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-20 10:31:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-20 10:31:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-20 10:31:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-11-20 10:31:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-11-20 10:31:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-20 10:31:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-11-20 10:31:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-11-20 10:31:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-11-20 10:31:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-11-20 10:31:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-20 10:31:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-11-20 10:31:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-11-20 10:31:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-11-20 10:31:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-11-20 10:31:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-11-20 10:31:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:45,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65913810] [2022-11-20 10:31:45,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65913810] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:45,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345702212] [2022-11-20 10:31:45,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:45,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:45,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:45,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:45,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:31:45,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:45,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:45,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-20 10:31:45,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-11-20 10:31:46,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5638 backedges. 0 proven. 2819 refuted. 0 times theorem prover too weak. 2819 trivial. 0 not checked. [2022-11-20 10:31:50,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345702212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:50,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:50,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 154 [2022-11-20 10:31:50,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110804561] [2022-11-20 10:31:50,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:50,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-11-20 10:31:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:50,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-11-20 10:31:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4132, Invalid=19738, Unknown=0, NotChecked=0, Total=23870 [2022-11-20 10:31:50,919 INFO L87 Difference]: Start difference. First operand 515 states and 665 transitions. Second operand has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) [2022-11-20 10:32:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:00,681 INFO L93 Difference]: Finished difference Result 1090 states and 1421 transitions. [2022-11-20 10:32:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2022-11-20 10:32:00,682 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) Word has length 458 [2022-11-20 10:32:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:00,688 INFO L225 Difference]: With dead ends: 1090 [2022-11-20 10:32:00,689 INFO L226 Difference]: Without dead ends: 1089 [2022-11-20 10:32:00,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1273 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27814 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=21886, Invalid=70226, Unknown=0, NotChecked=0, Total=92112 [2022-11-20 10:32:00,701 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 2398 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:00,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 1497 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 10:32:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-11-20 10:32:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1035. [2022-11-20 10:32:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 724 states have (on average 1.1422651933701657) internal successors, (827), 724 states have internal predecessors, (827), 308 states have call successors, (308), 104 states have call predecessors, (308), 2 states have return successors, (206), 206 states have call predecessors, (206), 206 states have call successors, (206) [2022-11-20 10:32:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1341 transitions. [2022-11-20 10:32:00,788 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1341 transitions. Word has length 458 [2022-11-20 10:32:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:00,789 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1341 transitions. [2022-11-20 10:32:00,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 154 states have (on average 2.0974025974025974) internal successors, (323), 104 states have internal predecessors, (323), 52 states have call successors, (155), 52 states have call predecessors, (155), 1 states have return successors, (104), 52 states have call predecessors, (104), 52 states have call successors, (104) [2022-11-20 10:32:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1341 transitions. [2022-11-20 10:32:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-11-20 10:32:00,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:00,827 INFO L195 NwaCegarLoop]: trace histogram [54, 54, 54, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:00,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:01,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:01,036 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 10:32:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1135257556, now seen corresponding path program 3 times [2022-11-20 10:32:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:01,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257426703] [2022-11-20 10:32:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:32:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:32:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-20 10:32:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:32:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 10:32:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:32:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:32:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:32:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:32:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:32:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:32:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:32:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:32:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 10:32:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 10:32:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 10:32:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:32:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 10:32:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:32:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 10:32:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-20 10:32:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-20 10:32:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 10:32:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-20 10:32:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-20 10:32:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 10:32:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-20 10:32:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-20 10:32:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-20 10:32:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-20 10:32:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-20 10:32:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-11-20 10:32:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-11-20 10:32:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-20 10:32:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-20 10:32:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-20 10:32:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-20 10:32:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-20 10:32:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-20 10:32:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-11-20 10:32:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-20 10:32:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2022-11-20 10:32:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-11-20 10:32:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2022-11-20 10:32:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-11-20 10:32:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-11-20 10:32:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2022-11-20 10:32:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-11-20 10:32:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-11-20 10:32:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-11-20 10:32:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2022-11-20 10:32:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-11-20 10:32:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-11-20 10:32:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2022-11-20 10:32:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-11-20 10:32:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2022-11-20 10:32:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2022-11-20 10:32:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 496 [2022-11-20 10:32:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 501 [2022-11-20 10:32:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2022-11-20 10:32:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2022-11-20 10:32:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2022-11-20 10:32:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2022-11-20 10:32:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2022-11-20 10:32:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2022-11-20 10:32:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2022-11-20 10:32:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 569 [2022-11-20 10:32:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2022-11-20 10:32:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 586 [2022-11-20 10:32:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2022-11-20 10:32:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2022-11-20 10:32:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 615 [2022-11-20 10:32:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 620 [2022-11-20 10:32:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2022-11-20 10:32:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2022-11-20 10:32:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 649 [2022-11-20 10:32:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 654 [2022-11-20 10:32:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2022-11-20 10:32:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2022-11-20 10:32:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2022-11-20 10:32:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2022-11-20 10:32:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 700 [2022-11-20 10:32:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 705 [2022-11-20 10:32:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2022-11-20 10:32:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 722 [2022-11-20 10:32:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2022-11-20 10:32:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2022-11-20 10:32:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2022-11-20 10:32:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2022-11-20 10:32:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 768 [2022-11-20 10:32:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 773 [2022-11-20 10:32:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2022-11-20 10:32:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 790 [2022-11-20 10:32:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 802 [2022-11-20 10:32:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 807 [2022-11-20 10:32:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2022-11-20 10:32:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 824 [2022-11-20 10:32:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 836 [2022-11-20 10:32:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 841 [2022-11-20 10:32:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 853 [2022-11-20 10:32:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 858 [2022-11-20 10:32:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2022-11-20 10:32:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2022-11-20 10:32:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 887 [2022-11-20 10:32:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 892 [2022-11-20 10:32:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22759 backedges. 0 proven. 11724 refuted. 0 times theorem prover too weak. 11035 trivial. 0 not checked. [2022-11-20 10:32:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257426703] [2022-11-20 10:32:20,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257426703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:20,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088064066] [2022-11-20 10:32:20,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:32:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:20,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:20,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:32:21,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:32:21,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:32:21,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:32:21,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22759 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 22353 trivial. 0 not checked. [2022-11-20 10:32:21,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:32:21,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088064066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:21,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:32:21,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [154] total 159 [2022-11-20 10:32:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39428432] [2022-11-20 10:32:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:21,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4244, Invalid=21196, Unknown=0, NotChecked=0, Total=25440 [2022-11-20 10:32:21,492 INFO L87 Difference]: Start difference. First operand 1035 states and 1341 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:32:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:21,955 INFO L93 Difference]: Finished difference Result 1238 states and 1544 transitions. [2022-11-20 10:32:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:32:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 900 [2022-11-20 10:32:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:21,962 INFO L225 Difference]: With dead ends: 1238 [2022-11-20 10:32:21,962 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:32:21,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1323 GetRequests, 1161 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8152 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4270, Invalid=22462, Unknown=0, NotChecked=0, Total=26732 [2022-11-20 10:32:21,975 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:21,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:32:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:32:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:32:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:32:21,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 900 [2022-11-20 10:32:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:21,980 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:32:21,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 10:32:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:32:21,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:32:21,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-20 10:32:21,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-20 10:32:21,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-20 10:32:21,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-20 10:32:21,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-20 10:32:21,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-20 10:32:21,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:22,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:22,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:32:43,645 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 854 DAG size of output: 269 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 10:32:43,662 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-20 10:32:43,662 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:32:43,663 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:32:43,664 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2022-11-20 10:32:43,664 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-11-20 10:32:43,664 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:32:43,664 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:32:43,664 INFO L902 garLoopResultBuilder]: At program point L53(lines 40 54) the Hoare annotation is: true [2022-11-20 10:32:43,664 INFO L902 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-11-20 10:32:43,665 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-11-20 10:32:43,665 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-11-20 10:32:43,665 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-11-20 10:32:43,665 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-11-20 10:32:43,665 INFO L895 garLoopResultBuilder]: At program point L47-2(line 47) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~n~0#1|)) [2022-11-20 10:32:43,666 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-11-20 10:32:43,666 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2022-11-20 10:32:43,666 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 2147483647) [2022-11-20 10:32:43,666 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-11-20 10:32:43,666 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-11-20 10:32:43,666 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L902 garLoopResultBuilder]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-11-20 10:32:43,667 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-11-20 10:32:43,668 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 16 38) no Hoare annotation was computed. [2022-11-20 10:32:43,668 INFO L899 garLoopResultBuilder]: For program point checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-20 10:32:43,668 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2022-11-20 10:32:43,668 INFO L899 garLoopResultBuilder]: For program point checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2022-11-20 10:32:43,668 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-11-20 10:32:43,668 INFO L899 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2022-11-20 10:32:43,674 INFO L895 garLoopResultBuilder]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse4 (<= |check_#in~y| 2147483646))) (let ((.cse5 (<= 1 check_~y)) (.cse6 (<= 1 check_~x)) (.cse3 (<= check_~y 2147483646)) (.cse0 (not .cse4)) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (< check_~x 2147483647) (not (< |check_#in~x| 2147483647))) (or .cse0 (<= check_~x 16) .cse1 .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (< check_~x 2147483646) (not (< |check_#in~x| 2147483645)) .cse1 .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483623)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (< check_~x 2147483627) .cse2 (not (< |check_#in~x| 2147483626))) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483631) .cse2) (or .cse0 (<= check_~x 23) .cse1 (not (<= |check_#in~x| 22)) .cse2) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483637))) (or .cse0 (<= check_~x 19) .cse1 (not (<= |check_#in~x| 18)) .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483625)) (< check_~x 2147483626)) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 7))) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483644)) (< check_~x 2147483645)) (or .cse0 .cse1 (< check_~x 2147483632) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 (<= check_~x 24) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 .cse1 (< check_~x 2147483634) .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483643)) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) (<= check_~x 15) .cse2) (or .cse0 .cse1 (not (< |check_#in~x| 2147483627)) .cse2 (< check_~x 2147483628)) (or (not (<= |check_#in~x| 16)) .cse0 .cse1 (<= check_~x 17) .cse2) (or .cse0 (<= check_~x 9) .cse1 .cse2 (not (<= |check_#in~x| 8))) (or .cse0 (not (= |check_#in~x| 0)) (and (= check_~x 0) (< 0 (+ check_~y 2147483648)) .cse3) (and .cse4 .cse5 (<= check_~x 1) .cse6 .cse3)) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483635) .cse2) (or .cse0 .cse1 (<= check_~x 5) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 21)) (<= check_~x 22)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 .cse1 (<= check_~x 12) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (not (<= |check_#in~x| 17)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 (< check_~x 2147483630) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (< check_~x 2147483625) .cse1 (not (< |check_#in~x| 2147483624)) .cse2) (or (not (<= |check_#in~x| 24)) .cse0 .cse1 (< check_~x 2147483623) .cse2) (or .cse0 .cse1 (and .cse4 .cse5 .cse6 .cse3) .cse2) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 11) .cse2) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (<= check_~x 2) (not (<= |check_#in~x| 1)) .cse2) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 14)) (or (not (< |check_#in~x| 2147483632)) .cse0 (< check_~x 2147483633) .cse1 .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) (< check_~x 2147483636) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483640)) (< check_~x 2147483641)) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) .cse2 (<= check_~x 6)) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483628))) (or .cse0 (not (<= |check_#in~x| 9)) .cse1 (<= check_~x 10) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) .cse2 (<= check_~x 13))))) [2022-11-20 10:32:43,676 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (not (<= |check_#in~y| 2147483646))) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483630) .cse2) (or .cse0 .cse1 (and (<= 2 check_~y) (<= 1 check_~x) .cse3) .cse2) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 21))) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) .cse2 (<= check_~x 14)) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 10) .cse2) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse3) (not (= |check_#in~x| 0))) (or (not (<= |check_#in~x| 24)) .cse0 (<= check_~x 24) .cse1 .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 22)) .cse2 (<= check_~x 22)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 (not (<= |check_#in~x| 18)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 13)) (or .cse0 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483628)) (< check_~x 2147483628)) (or .cse0 .cse1 .cse2 (< check_~x 2147483626) (not (< |check_#in~x| 2147483626))) (or .cse0 .cse1 .cse2 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483624)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse2) (or .cse0 .cse1 (<= check_~x 15) .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483631) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483640))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 .cse2 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (< check_~x 2147483623) (not (< |check_#in~x| 2147483623)) .cse2) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (<= check_~x 23) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 (< check_~x 2147483636) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (<= check_~x 19) .cse1 .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (<= check_~x 2) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (not (< |check_#in~x| 2147483645)) .cse1 .cse2 (< check_~x 2147483645)) (or (not (< |check_#in~x| 2147483632)) .cse0 .cse1 (< check_~x 2147483632) .cse2) (or .cse0 (< check_~x 2147483633) .cse1 .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) (<= check_~x 12) .cse2) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483634) .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) .cse1 (< check_~x 2147483635) .cse2) (or (not (<= |check_#in~x| 16)) .cse0 (<= check_~x 16) .cse1 .cse2) (or .cse0 (< check_~x 2147483625) .cse1 .cse2 (not (< |check_#in~x| 2147483625))) (or .cse0 .cse1 (<= check_~x 11) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (<= check_~x 17) (not (<= |check_#in~x| 17)) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 1)) .cse2 (<= check_~x 1)) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483641)) (or .cse0 .cse1 (< check_~x 2147483627) (not (< |check_#in~x| 2147483627)) .cse2))) [2022-11-20 10:32:43,678 INFO L895 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (not (<= |check_#in~y| 2147483646))) (.cse1 (not (<= 1 |check_#in~x|))) (.cse2 (not (<= 1 |check_#in~y|)))) (and (or .cse0 .cse1 (not (< |check_#in~x| 2147483630)) (< check_~x 2147483630) .cse2) (or .cse0 .cse1 (and (<= 2 check_~y) (<= 1 check_~x) .cse3) .cse2) (or .cse0 .cse1 (<= check_~x 21) .cse2 (not (<= |check_#in~x| 21))) (or .cse0 .cse1 (not (<= |check_#in~x| 14)) .cse2 (<= check_~x 14)) (or .cse0 (not (<= |check_#in~x| 10)) .cse1 (<= check_~x 10) .cse2) (or .cse0 (and (<= (+ check_~x 1) check_~y) (= check_~x 0) .cse3) (not (= |check_#in~x| 0))) (or (not (<= |check_#in~x| 24)) .cse0 (<= check_~x 24) .cse1 .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 22)) .cse2 (<= check_~x 22)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 6)) (<= check_~x 6)) (or .cse0 .cse1 (not (<= |check_#in~x| 18)) .cse2 (<= check_~x 18)) (or .cse0 .cse1 .cse2 (not (<= |check_#in~x| 13)) (<= check_~x 13)) (or .cse0 (not (<= |check_#in~x| 9)) (<= check_~x 9) .cse1 .cse2) (or .cse0 .cse1 .cse2 (not (< |check_#in~x| 2147483628)) (< check_~x 2147483628)) (or .cse0 .cse1 .cse2 (< check_~x 2147483626) (not (< |check_#in~x| 2147483626))) (or .cse0 .cse1 .cse2 (<= check_~x 7) (not (<= |check_#in~x| 7))) (or .cse0 .cse1 (not (< |check_#in~x| 2147483624)) .cse2 (< check_~x 2147483624)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (not (<= |check_#in~x| 8))) (or .cse0 .cse1 (not (<= |check_#in~x| 5)) (<= check_~x 5) .cse2) (or .cse0 .cse1 (<= check_~x 15) .cse2 (not (<= |check_#in~x| 15))) (or .cse0 .cse1 (< check_~x 2147483631) .cse2 (not (< |check_#in~x| 2147483631))) (or .cse0 .cse1 (< check_~x 2147483640) .cse2 (not (< |check_#in~x| 2147483640))) (or .cse0 (not (< |check_#in~x| 2147483642)) .cse1 .cse2 (< check_~x 2147483642)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (not (<= |check_#in~x| 3))) (or .cse0 .cse1 (<= check_~x 20) .cse2 (not (<= |check_#in~x| 20))) (or .cse0 .cse1 .cse2 (< check_~x 2147483643) (not (< |check_#in~x| 2147483643))) (or .cse0 .cse1 (< check_~x 2147483623) (not (< |check_#in~x| 2147483623)) .cse2) (or .cse0 (< check_~x 2147483639) .cse1 .cse2 (not (< |check_#in~x| 2147483639))) (or .cse0 (<= check_~x 23) .cse1 .cse2 (not (<= |check_#in~x| 23))) (or .cse0 (< check_~x 2147483636) .cse1 .cse2 (not (< |check_#in~x| 2147483636))) (or .cse0 (<= check_~x 19) .cse1 .cse2 (not (<= |check_#in~x| 19))) (or .cse0 .cse1 (< check_~x 2147483644) .cse2 (not (< |check_#in~x| 2147483644))) (or .cse0 .cse1 (<= check_~x 2) .cse2 (not (<= |check_#in~x| 2))) (or .cse0 (< check_~x 2147483637) .cse1 .cse2 (not (< |check_#in~x| 2147483637))) (or .cse0 .cse1 (< check_~x 2147483629) .cse2 (not (< |check_#in~x| 2147483629))) (or .cse0 (not (< |check_#in~x| 2147483645)) .cse1 .cse2 (< check_~x 2147483645)) (or (not (< |check_#in~x| 2147483632)) .cse0 .cse1 (< check_~x 2147483632) .cse2) (or .cse0 (< check_~x 2147483633) .cse1 .cse2 (not (< |check_#in~x| 2147483633))) (or .cse0 .cse1 (not (<= |check_#in~x| 12)) (<= check_~x 12) .cse2) (or (not (< |check_#in~x| 2147483634)) .cse0 .cse1 (< check_~x 2147483634) .cse2) (or .cse0 (not (< |check_#in~x| 2147483635)) .cse1 (< check_~x 2147483635) .cse2) (or (not (<= |check_#in~x| 16)) .cse0 (<= check_~x 16) .cse1 .cse2) (or .cse0 (< check_~x 2147483625) .cse1 .cse2 (not (< |check_#in~x| 2147483625))) (or .cse0 .cse1 (<= check_~x 11) .cse2 (not (<= |check_#in~x| 11))) (or .cse0 .cse1 (<= check_~x 4) .cse2 (not (<= |check_#in~x| 4))) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (< check_~x 2147483638) (not (< |check_#in~x| 2147483638))) (or .cse0 .cse1 (<= check_~x 17) (not (<= |check_#in~x| 17)) .cse2) (or .cse0 .cse1 (not (<= |check_#in~x| 1)) .cse2 (<= check_~x 1)) (or .cse0 .cse1 (not (< |check_#in~x| 2147483641)) .cse2 (< check_~x 2147483641)) (or .cse0 .cse1 (< check_~x 2147483627) (not (< |check_#in~x| 2147483627)) .cse2))) [2022-11-20 10:32:43,678 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 16 38) no Hoare annotation was computed. [2022-11-20 10:32:43,678 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-11-20 10:32:43,678 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-11-20 10:32:43,678 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-11-20 10:32:43,679 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-11-20 10:32:43,679 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2022-11-20 10:32:43,679 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2022-11-20 10:32:43,683 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:43,685 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:32:43,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:32:43 BoogieIcfgContainer [2022-11-20 10:32:43,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:32:43,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:32:43,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:32:43,695 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:32:43,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:31:18" (3/4) ... [2022-11-20 10:32:43,699 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:32:43,706 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 10:32:43,707 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2022-11-20 10:32:43,707 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 10:32:43,711 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-20 10:32:43,712 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 10:32:43,712 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:32:43,712 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:32:43,750 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:32:43,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:32:43,751 INFO L158 Benchmark]: Toolchain (without parser) took 86699.02ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 135.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 236.7MB. Max. memory is 16.1GB. [2022-11-20 10:32:43,752 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:32:43,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.55ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 132.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:32:43,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.93ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 131.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:32:43,753 INFO L158 Benchmark]: Boogie Preprocessor took 22.64ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 129.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:32:43,753 INFO L158 Benchmark]: RCFGBuilder took 572.10ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 116.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 10:32:43,753 INFO L158 Benchmark]: TraceAbstraction took 85672.73ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 115.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-20 10:32:43,754 INFO L158 Benchmark]: Witness Printer took 56.04ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:32:43,756 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 98.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.55ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 132.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.93ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 131.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.64ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 129.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 572.10ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 116.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 85672.73ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 115.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 56.04ms. Allocated memory is still 1.7GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 85.6s, OverallIterations: 14, TraceHistogramMax: 54, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5276 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5276 mSDsluCounter, 4741 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4078 mSDsCounter, 996 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3588 IncrementalHoareTripleChecker+Invalid, 4584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 996 mSolverCounterUnsat, 663 mSDtfsCounter, 3588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4546 GetRequests, 3637 SyntacticMatches, 0 SemanticMatches, 909 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49364 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1035occurred in iteration=13, InterpolantAutomatonStates: 534, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 1243 PreInvPairs, 2059 NumberOfFragments, 3049 HoareAnnotationTreeSize, 1243 FomulaSimplifications, 4701 FormulaSimplificationTreeSizeReduction, 6.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 524052 FormulaSimplificationTreeSizeReductionInter, 15.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 4268 NumberOfCodeBlocks, 3395 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 9750 SizeOfPredicates, 118 NumberOfNonLiveVariables, 4381 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 47569/70567 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 10:32:43,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b323628b-91ff-47fb-919b-9eb8dac2e360/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE