./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:52:00,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:52:00,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-28 03:52:00,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:52:00,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:52:00,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:52:00,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:52:00,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:52:00,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:52:00,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:52:00,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:52:00,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:52:00,975 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:52:00,975 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-28 03:52:00,975 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-28 03:52:00,975 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-28 03:52:00,975 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-28 03:52:00,975 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-28 03:52:00,976 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-28 03:52:00,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:52:00,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-28 03:52:00,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:52:00,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:52:00,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-28 03:52:00,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-28 03:52:00,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-28 03:52:00,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:52:00,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:52:00,977 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-28 03:52:00,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:52:00,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:52:00,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:52:00,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:52:00,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:52:00,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-28 03:52:00,979 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-28 03:52:00,979 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a [2024-11-28 03:52:01,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:52:01,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:52:01,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:52:01,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:52:01,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:52:01,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-11-28 03:52:05,003 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/data/2f25fc1f4/80fb4c5c312f48e290be40244bef5725/FLAGf526ddb82 [2024-11-28 03:52:05,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:52:05,450 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-11-28 03:52:05,461 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/data/2f25fc1f4/80fb4c5c312f48e290be40244bef5725/FLAGf526ddb82 [2024-11-28 03:52:05,479 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/data/2f25fc1f4/80fb4c5c312f48e290be40244bef5725 [2024-11-28 03:52:05,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:52:05,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:52:05,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:52:05,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:52:05,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:52:05,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:05" (1/1) ... [2024-11-28 03:52:05,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc19805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:05, skipping insertion in model container [2024-11-28 03:52:05,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:05" (1/1) ... [2024-11-28 03:52:05,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:52:05,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:52:05,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:52:06,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:52:06,102 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:52:06,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06 WrapperNode [2024-11-28 03:52:06,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:52:06,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:52:06,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:52:06,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:52:06,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,152 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-11-28 03:52:06,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:52:06,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:52:06,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:52:06,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:52:06,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,192 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-28 03:52:06,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:52:06,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:52:06,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:52:06,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:52:06,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (1/1) ... [2024-11-28 03:52:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:06,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:06,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-28 03:52:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:52:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:52:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:52:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:52:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:52:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:52:06,415 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:52:06,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:52:06,574 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 03:52:06,575 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:52:06,587 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:52:06,587 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:52:06,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:06 BoogieIcfgContainer [2024-11-28 03:52:06,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:52:06,588 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-28 03:52:06,588 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-28 03:52:06,597 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-28 03:52:06,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 03:52:06,598 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:05" (1/3) ... [2024-11-28 03:52:06,599 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56f67d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:06, skipping insertion in model container [2024-11-28 03:52:06,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 03:52:06,600 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:06" (2/3) ... [2024-11-28 03:52:06,601 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56f67d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:06, skipping insertion in model container [2024-11-28 03:52:06,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 03:52:06,602 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:06" (3/3) ... [2024-11-28 03:52:06,603 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2024-11-28 03:52:06,683 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-28 03:52:06,684 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-28 03:52:06,684 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-28 03:52:06,684 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-28 03:52:06,684 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-28 03:52:06,684 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-28 03:52:06,684 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-28 03:52:06,685 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-28 03:52:06,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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) [2024-11-28 03:52:06,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-28 03:52:06,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:06,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:06,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-28 03:52:06,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-28 03:52:06,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-28 03:52:06,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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) [2024-11-28 03:52:06,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-28 03:52:06,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:06,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:06,727 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-28 03:52:06,727 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-28 03:52:06,738 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" [2024-11-28 03:52:06,738 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" [2024-11-28 03:52:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-11-28 03:52:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:06,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093051968] [2024-11-28 03:52:06,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:06,891 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:06,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:06,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:06,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1605, now seen corresponding path program 1 times [2024-11-28 03:52:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:06,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014817506] [2024-11-28 03:52:06,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:06,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:06,943 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:06,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815501, now seen corresponding path program 1 times [2024-11-28 03:52:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107713597] [2024-11-28 03:52:06,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:06,992 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:07,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:07,671 INFO L204 LassoAnalysis]: Preferences: [2024-11-28 03:52:07,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-28 03:52:07,674 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-28 03:52:07,674 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-28 03:52:07,674 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-28 03:52:07,674 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:07,675 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-28 03:52:07,675 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-28 03:52:07,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2024-11-28 03:52:07,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-28 03:52:07,676 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-28 03:52:07,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:07,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:08,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:08,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:08,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:08,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-28 03:52:08,382 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-28 03:52:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-28 03:52:08,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:52:08,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-28 03:52:08,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:52:08,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-28 03:52:08,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-28 03:52:08,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-28 03:52:08,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:52:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-28 03:52:08,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-28 03:52:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-28 03:52:08,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-28 03:52:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-28 03:52:08,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:08,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:08,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:08,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-28 03:52:08,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,648 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-28 03:52:08,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:52:08,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:52:08,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:08,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:52:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-28 03:52:08,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:08,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:08,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:08,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:08,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:08,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:52:08,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:52:08,758 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-28 03:52:08,808 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-28 03:52:08,812 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-28 03:52:08,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:08,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:08,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:08,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-28 03:52:08,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-28 03:52:08,846 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-28 03:52:08,847 INFO L474 LassoAnalysis]: Proved termination. [2024-11-28 03:52:08,847 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-28 03:52:08,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-28 03:52:08,891 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-28 03:52:08,908 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-28 03:52:08,909 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-28 03:52:08,910 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-28 03:52:08,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:08,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:52:08,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:08,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:52:08,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:52:09,060 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-28 03:52:09,062 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-28 03:52:09,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Result 32 states and 44 transitions. Complement of second has 6 states. [2024-11-28 03:52:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-28 03:52:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-28 03:52:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-28 03:52:09,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-28 03:52:09,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:52:09,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-28 03:52:09,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:52:09,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-28 03:52:09,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:52:09,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2024-11-28 03:52:09,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:09,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 14 states and 19 transitions. [2024-11-28 03:52:09,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-28 03:52:09,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-28 03:52:09,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-11-28 03:52:09,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:52:09,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-28 03:52:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-11-28 03:52:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-28 03:52:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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) [2024-11-28 03:52:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2024-11-28 03:52:09,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-28 03:52:09,182 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-11-28 03:52:09,182 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-28 03:52:09,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2024-11-28 03:52:09,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:09,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:09,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:09,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:09,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:52:09,184 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" [2024-11-28 03:52:09,184 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume !true;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2024-11-28 03:52:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815567, now seen corresponding path program 1 times [2024-11-28 03:52:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344618777] [2024-11-28 03:52:09,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,203 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 64035, now seen corresponding path program 1 times [2024-11-28 03:52:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333968672] [2024-11-28 03:52:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:09,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333968672] [2024-11-28 03:52:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333968672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965835396] [2024-11-28 03:52:09,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:09,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:09,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:09,249 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:09,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:52:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:09,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:52:09,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:09,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965835396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:09,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-28 03:52:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644273272] [2024-11-28 03:52:09,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:09,304 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 03:52:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:09,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:52:09,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:52:09,308 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-28 03:52:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:09,313 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2024-11-28 03:52:09,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2024-11-28 03:52:09,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:09,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2024-11-28 03:52:09,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-28 03:52:09,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-28 03:52:09,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2024-11-28 03:52:09,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:52:09,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-28 03:52:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2024-11-28 03:52:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-28 03:52:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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) [2024-11-28 03:52:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-11-28 03:52:09,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-28 03:52:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:52:09,319 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-28 03:52:09,319 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-28 03:52:09,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-11-28 03:52:09,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:09,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:09,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:09,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:09,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:52:09,325 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" [2024-11-28 03:52:09,326 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2024-11-28 03:52:09,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815567, now seen corresponding path program 2 times [2024-11-28 03:52:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646735070] [2024-11-28 03:52:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,343 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:09,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1976301, now seen corresponding path program 1 times [2024-11-28 03:52:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:09,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427688789] [2024-11-28 03:52:09,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,364 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1328897477, now seen corresponding path program 1 times [2024-11-28 03:52:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221856606] [2024-11-28 03:52:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,392 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:09,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:09,787 INFO L204 LassoAnalysis]: Preferences: [2024-11-28 03:52:09,787 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-28 03:52:09,787 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-28 03:52:09,787 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-28 03:52:09,787 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-28 03:52:09,787 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:09,788 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-28 03:52:09,788 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-28 03:52:09,788 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2024-11-28 03:52:09,788 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-28 03:52:09,788 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-28 03:52:09,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:09,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:09,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:09,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:09,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:52:10,280 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-28 03:52:10,281 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-28 03:52:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,285 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-28 03:52:10,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:10,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:10,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:10,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:10,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:10,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:10,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:10,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:10,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:10,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-28 03:52:10,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,332 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-28 03:52:10,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:10,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:10,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:10,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:10,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:10,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:10,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:10,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:10,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:10,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-28 03:52:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,369 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-28 03:52:10,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:10,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:10,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:10,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:10,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:10,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:10,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:10,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:10,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:10,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-28 03:52:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,412 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-28 03:52:10,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:10,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:10,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:52:10,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:10,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:10,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:10,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:52:10,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:52:10,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:10,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-28 03:52:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,455 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-28 03:52:10,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:10,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:10,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:10,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:10,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:10,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:52:10,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:52:10,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:52:10,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-28 03:52:10,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,512 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-28 03:52:10,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:52:10,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:52:10,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:52:10,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:52:10,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:52:10,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:52:10,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:52:10,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-28 03:52:10,604 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-28 03:52:10,605 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-28 03:52:10,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:52:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:10,610 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:10,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-28 03:52:10,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-28 03:52:10,631 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-28 03:52:10,632 INFO L474 LassoAnalysis]: Proved termination. [2024-11-28 03:52:10,632 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 8*ULTIMATE.start_main_~j~0#1 Supporting invariants [-1*ULTIMATE.start_main_~length~0#1 + 1 >= 0] [2024-11-28 03:52:10,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-28 03:52:10,660 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-28 03:52:10,664 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-28 03:52:10,665 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-28 03:52:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:10,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:52:10,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:10,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:52:10,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:52:10,922 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2024-11-28 03:52:10,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2024-11-28 03:52:11,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) Result 35 states and 44 transitions. Complement of second has 11 states. [2024-11-28 03:52:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-28 03:52:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2024-11-28 03:52:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2024-11-28 03:52:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-28 03:52:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:52:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-28 03:52:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:52:11,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 7 letters. Loop has 8 letters. [2024-11-28 03:52:11,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:52:11,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2024-11-28 03:52:11,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:11,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 43 transitions. [2024-11-28 03:52:11,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-28 03:52:11,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-28 03:52:11,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2024-11-28 03:52:11,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-28 03:52:11,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-28 03:52:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2024-11-28 03:52:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-11-28 03:52:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 28 states have internal predecessors, (38), 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) [2024-11-28 03:52:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-28 03:52:11,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-28 03:52:11,138 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-28 03:52:11,138 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-28 03:52:11,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2024-11-28 03:52:11,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:11,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:11,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:11,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:11,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:52:11,140 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume main_~length~0#1 < 1;main_~length~0#1 := 1;" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" [2024-11-28 03:52:11,140 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2024-11-28 03:52:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 119449461, now seen corresponding path program 1 times [2024-11-28 03:52:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863400238] [2024-11-28 03:52:11,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:11,158 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:11,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 69611, now seen corresponding path program 1 times [2024-11-28 03:52:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986022906] [2024-11-28 03:52:11,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:11,183 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:11,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2008955913, now seen corresponding path program 1 times [2024-11-28 03:52:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:11,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105540860] [2024-11-28 03:52:11,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105540860] [2024-11-28 03:52:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105540860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933917030] [2024-11-28 03:52:11,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:11,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:11,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:11,617 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:11,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 03:52:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:11,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:52:11,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:11,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:52:11,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:11,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933917030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:11,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-28 03:52:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976871529] [2024-11-28 03:52:11,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:11,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:52:11,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:52:11,907 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. cyclomatic complexity: 14 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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) [2024-11-28 03:52:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:12,029 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-28 03:52:12,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 62 transitions. [2024-11-28 03:52:12,030 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2024-11-28 03:52:12,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 49 states and 60 transitions. [2024-11-28 03:52:12,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-28 03:52:12,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-28 03:52:12,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 60 transitions. [2024-11-28 03:52:12,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-28 03:52:12,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-28 03:52:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 60 transitions. [2024-11-28 03:52:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2024-11-28 03:52:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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) [2024-11-28 03:52:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-28 03:52:12,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-28 03:52:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:52:12,041 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-28 03:52:12,041 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-28 03:52:12,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-11-28 03:52:12,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:12,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:12,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:12,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:12,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:52:12,043 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume main_~length~0#1 < 1;main_~length~0#1 := 1;" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2024-11-28 03:52:12,043 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2024-11-28 03:52:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2146878217, now seen corresponding path program 1 times [2024-11-28 03:52:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34447241] [2024-11-28 03:52:12,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34447241] [2024-11-28 03:52:12,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34447241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:12,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005035611] [2024-11-28 03:52:12,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:12,159 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:12,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 03:52:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:12,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:52:12,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:12,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005035611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:12,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-28 03:52:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383909524] [2024-11-28 03:52:12,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:12,345 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-28 03:52:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 69611, now seen corresponding path program 2 times [2024-11-28 03:52:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263159182] [2024-11-28 03:52:12,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:12,363 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:12,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:12,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:52:12,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:52:12,439 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-11-28 03:52:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:12,498 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-28 03:52:12,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-11-28 03:52:12,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:12,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 34 transitions. [2024-11-28 03:52:12,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-28 03:52:12,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-28 03:52:12,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2024-11-28 03:52:12,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-28 03:52:12,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-28 03:52:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2024-11-28 03:52:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-28 03:52:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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) [2024-11-28 03:52:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-28 03:52:12,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-28 03:52:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:52:12,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-28 03:52:12,511 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-28 03:52:12,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2024-11-28 03:52:12,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:12,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:12,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:12,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:12,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:52:12,515 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:12,515 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash -147123404, now seen corresponding path program 1 times [2024-11-28 03:52:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362741678] [2024-11-28 03:52:12,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:12,543 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:12,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:12,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 2 times [2024-11-28 03:52:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943122168] [2024-11-28 03:52:12,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:12,585 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:12,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:12,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash -261223224, now seen corresponding path program 1 times [2024-11-28 03:52:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654110895] [2024-11-28 03:52:12,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:12,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-28 03:52:12,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-28 03:52:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654110895] [2024-11-28 03:52:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654110895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310883361] [2024-11-28 03:52:13,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:13,083 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:13,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 03:52:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:13,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 03:52:13,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:13,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:52:13,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:52:13,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310883361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:13,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:13,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-11-28 03:52:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321487354] [2024-11-28 03:52:13,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:13,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:52:13,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:52:13,559 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 9 Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 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) [2024-11-28 03:52:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:13,813 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-28 03:52:13,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2024-11-28 03:52:13,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:13,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 40 transitions. [2024-11-28 03:52:13,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-28 03:52:13,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-28 03:52:13,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2024-11-28 03:52:13,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-28 03:52:13,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-28 03:52:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2024-11-28 03:52:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-28 03:52:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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) [2024-11-28 03:52:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-28 03:52:13,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-28 03:52:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:52:13,820 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-28 03:52:13,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-28 03:52:13,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2024-11-28 03:52:13,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:52:13,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:13,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:13,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:13,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:52:13,823 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2024-11-28 03:52:13,823 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" [2024-11-28 03:52:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1753851207, now seen corresponding path program 2 times [2024-11-28 03:52:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388819274] [2024-11-28 03:52:13,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388819274] [2024-11-28 03:52:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388819274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362224212] [2024-11-28 03:52:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:13,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:13,932 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:13,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 03:52:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:13,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:52:13,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:14,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362224212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:14,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-28 03:52:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211123574] [2024-11-28 03:52:14,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:14,131 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-28 03:52:14,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 69611, now seen corresponding path program 3 times [2024-11-28 03:52:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152442100] [2024-11-28 03:52:14,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:14,139 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:14,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:52:14,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:52:14,207 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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) [2024-11-28 03:52:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:14,279 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-28 03:52:14,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 30 transitions. [2024-11-28 03:52:14,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:14,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 24 transitions. [2024-11-28 03:52:14,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-28 03:52:14,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-28 03:52:14,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2024-11-28 03:52:14,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:52:14,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-28 03:52:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2024-11-28 03:52:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-28 03:52:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 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) [2024-11-28 03:52:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-28 03:52:14,283 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-28 03:52:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:52:14,287 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-28 03:52:14,288 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-28 03:52:14,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2024-11-28 03:52:14,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:14,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:14,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:14,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:14,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:52:14,290 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:52:14,290 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:52:14,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash -261223226, now seen corresponding path program 1 times [2024-11-28 03:52:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345563203] [2024-11-28 03:52:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:14,323 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:14,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:14,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash 76241, now seen corresponding path program 4 times [2024-11-28 03:52:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475802624] [2024-11-28 03:52:14,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:14,353 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:14,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:14,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:14,359 INFO L85 PathProgramCache]: Analyzing trace with hash 379661036, now seen corresponding path program 1 times [2024-11-28 03:52:14,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:14,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739163257] [2024-11-28 03:52:14,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739163257] [2024-11-28 03:52:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739163257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667371666] [2024-11-28 03:52:15,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:15,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:15,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:15,012 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:15,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 03:52:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 03:52:15,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:15,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:52:15,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:52:15,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:52:15,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2024-11-28 03:52:15,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667371666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:15,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-11-28 03:52:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810258038] [2024-11-28 03:52:15,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:15,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:52:15,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:52:15,615 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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) [2024-11-28 03:52:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:16,003 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-28 03:52:16,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2024-11-28 03:52:16,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:16,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2024-11-28 03:52:16,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-28 03:52:16,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-28 03:52:16,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-28 03:52:16,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:52:16,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-28 03:52:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-28 03:52:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-28 03:52:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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) [2024-11-28 03:52:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-28 03:52:16,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-28 03:52:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:52:16,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-28 03:52:16,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-28 03:52:16,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2024-11-28 03:52:16,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:16,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:16,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:16,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:16,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:52:16,011 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:16,011 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:16,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 379661038, now seen corresponding path program 2 times [2024-11-28 03:52:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:16,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826424324] [2024-11-28 03:52:16,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,046 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 3 times [2024-11-28 03:52:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081346696] [2024-11-28 03:52:16,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,076 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:16,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash 992851842, now seen corresponding path program 3 times [2024-11-28 03:52:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338887800] [2024-11-28 03:52:16,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338887800] [2024-11-28 03:52:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338887800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387806510] [2024-11-28 03:52:16,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:16,272 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:16,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 03:52:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:16,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:52:16,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:16,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387806510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:16,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-28 03:52:16,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191403558] [2024-11-28 03:52:16,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:16,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:16,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:52:16,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:52:16,622 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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) [2024-11-28 03:52:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:16,713 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-28 03:52:16,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 42 transitions. [2024-11-28 03:52:16,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:16,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 29 transitions. [2024-11-28 03:52:16,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-28 03:52:16,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-28 03:52:16,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2024-11-28 03:52:16,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:52:16,715 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-28 03:52:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2024-11-28 03:52:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-28 03:52:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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) [2024-11-28 03:52:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-28 03:52:16,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-28 03:52:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:52:16,719 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-28 03:52:16,719 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-28 03:52:16,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2024-11-28 03:52:16,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:16,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:16,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:16,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:16,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:52:16,720 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:16,721 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash -320186318, now seen corresponding path program 4 times [2024-11-28 03:52:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998599776] [2024-11-28 03:52:16,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,750 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 4 times [2024-11-28 03:52:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:16,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257020889] [2024-11-28 03:52:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,774 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:16,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:16,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1121362630, now seen corresponding path program 5 times [2024-11-28 03:52:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916590829] [2024-11-28 03:52:16,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916590829] [2024-11-28 03:52:17,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916590829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:17,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047536999] [2024-11-28 03:52:17,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:17,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:17,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:17,525 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:17,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-28 03:52:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:17,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 03:52:17,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:17,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:52:17,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:52:17,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:52:17,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:52:17,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:52:17,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2024-11-28 03:52:18,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:52:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047536999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:52:18,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:52:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2024-11-28 03:52:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765685683] [2024-11-28 03:52:18,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:52:18,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:52:18,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 03:52:18,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-28 03:52:18,447 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 25 states have internal predecessors, (65), 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) [2024-11-28 03:52:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:52:19,402 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-28 03:52:19,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 89 transitions. [2024-11-28 03:52:19,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:19,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 89 transitions. [2024-11-28 03:52:19,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-11-28 03:52:19,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-28 03:52:19,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 89 transitions. [2024-11-28 03:52:19,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:52:19,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-28 03:52:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 89 transitions. [2024-11-28 03:52:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2024-11-28 03:52:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 62 states have internal predecessors, (68), 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) [2024-11-28 03:52:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2024-11-28 03:52:19,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-11-28 03:52:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 03:52:19,420 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2024-11-28 03:52:19,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-28 03:52:19,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 68 transitions. [2024-11-28 03:52:19,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:52:19,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:52:19,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:52:19,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:52:19,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:52:19,422 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:19,422 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:52:19,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 509696510, now seen corresponding path program 6 times [2024-11-28 03:52:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028559922] [2024-11-28 03:52:19,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:19,460 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:19,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 5 times [2024-11-28 03:52:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335183560] [2024-11-28 03:52:19,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:19,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:19,492 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:52:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:52:19,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:52:19,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:52:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -98574702, now seen corresponding path program 7 times [2024-11-28 03:52:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:52:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891758298] [2024-11-28 03:52:19,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:52:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:52:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891758298] [2024-11-28 03:52:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891758298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:52:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877047589] [2024-11-28 03:52:20,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:52:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:52:20,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:20,707 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:52:20,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-28 03:52:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:52:20,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 03:52:20,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:52:20,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:52:20,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:52:20,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:52:20,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:52:21,043 INFO L349 Elim1Store]: treesize reduction 82, result has 24.1 percent of original size [2024-11-28 03:52:21,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 60 [2024-11-28 03:52:21,342 INFO L349 Elim1Store]: treesize reduction 197, result has 19.9 percent of original size [2024-11-28 03:52:21,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 74 treesize of output 88 [2024-11-28 03:52:21,789 INFO L349 Elim1Store]: treesize reduction 348, result has 17.1 percent of original size [2024-11-28 03:52:21,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 96 treesize of output 116 [2024-11-28 03:52:22,921 INFO L349 Elim1Store]: treesize reduction 375, result has 15.7 percent of original size [2024-11-28 03:52:22,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 42 case distinctions, treesize of input 105 treesize of output 119 [2024-11-28 03:52:23,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:54:03,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877047589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:54:03,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:54:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 33 [2024-11-28 03:54:03,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305145875] [2024-11-28 03:54:03,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:54:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:54:03,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:54:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=957, Unknown=8, NotChecked=0, Total=1122 [2024-11-28 03:54:03,655 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. cyclomatic complexity: 7 Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 34 states have internal predecessors, (83), 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) [2024-11-28 03:54:07,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:54:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:15,162 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-28 03:54:15,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 83 transitions. [2024-11-28 03:54:15,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:54:15,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 83 transitions. [2024-11-28 03:54:15,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-28 03:54:15,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-28 03:54:15,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 83 transitions. [2024-11-28 03:54:15,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:54:15,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-28 03:54:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 83 transitions. [2024-11-28 03:54:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 33. [2024-11-28 03:54:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 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) [2024-11-28 03:54:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-28 03:54:15,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-28 03:54:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-28 03:54:15,176 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-28 03:54:15,176 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-28 03:54:15,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2024-11-28 03:54:15,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:54:15,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:54:15,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:54:15,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:15,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:54:15,178 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:54:15,178 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:54:15,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash 258468910, now seen corresponding path program 8 times [2024-11-28 03:54:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:15,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086466497] [2024-11-28 03:54:15,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:15,208 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:15,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:15,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 76241, now seen corresponding path program 5 times [2024-11-28 03:54:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708750622] [2024-11-28 03:54:15,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:15,233 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:15,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:15,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:15,239 INFO L85 PathProgramCache]: Analyzing trace with hash -829017468, now seen corresponding path program 9 times [2024-11-28 03:54:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:15,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75324416] [2024-11-28 03:54:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:15,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:54:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75324416] [2024-11-28 03:54:17,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75324416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:54:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718447203] [2024-11-28 03:54:17,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:17,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:54:17,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:54:17,458 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:54:17,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-28 03:54:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:17,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 03:54:17,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:54:17,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:54:17,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:54:17,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:17,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:54:18,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:18,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2024-11-28 03:54:19,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:19,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2024-11-28 03:54:19,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:19,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2024-11-28 03:54:19,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:54:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718447203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:54:21,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:54:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 29 [2024-11-28 03:54:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630623446] [2024-11-28 03:54:21,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:54:21,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:54:21,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:54:21,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:54:21,342 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand has 30 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 30 states have internal predecessors, (77), 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) [2024-11-28 03:54:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:25,931 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-28 03:54:25,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 119 transitions. [2024-11-28 03:54:25,932 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2024-11-28 03:54:25,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 119 transitions. [2024-11-28 03:54:25,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-28 03:54:25,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2024-11-28 03:54:25,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 119 transitions. [2024-11-28 03:54:25,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:54:25,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 119 transitions. [2024-11-28 03:54:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 119 transitions. [2024-11-28 03:54:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 60. [2024-11-28 03:54:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 59 states have internal predecessors, (65), 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) [2024-11-28 03:54:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-28 03:54:25,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-28 03:54:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-28 03:54:25,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-28 03:54:25,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-28 03:54:25,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 65 transitions. [2024-11-28 03:54:25,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:54:25,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:54:25,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:54:25,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:25,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:54:25,943 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:54:25,943 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:54:25,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -829017466, now seen corresponding path program 10 times [2024-11-28 03:54:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:25,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451474365] [2024-11-28 03:54:25,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:25,965 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:25,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:25,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 6 times [2024-11-28 03:54:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:25,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230279259] [2024-11-28 03:54:25,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:25,985 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:25,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1537553178, now seen corresponding path program 11 times [2024-11-28 03:54:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94183995] [2024-11-28 03:54:25,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:54:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94183995] [2024-11-28 03:54:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94183995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:54:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770872935] [2024-11-28 03:54:26,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:26,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:54:26,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:54:26,564 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:54:26,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-28 03:54:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:26,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:54:26,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:54:27,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:54:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770872935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:54:28,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:54:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-28 03:54:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352959089] [2024-11-28 03:54:28,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:54:28,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:54:28,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:54:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:54:28,384 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. cyclomatic complexity: 7 Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 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) [2024-11-28 03:54:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:28,966 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-28 03:54:28,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 87 transitions. [2024-11-28 03:54:28,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:54:28,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 64 transitions. [2024-11-28 03:54:28,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-28 03:54:28,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-28 03:54:28,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 64 transitions. [2024-11-28 03:54:28,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:54:28,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-28 03:54:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 64 transitions. [2024-11-28 03:54:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-28 03:54:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 59 states have internal predecessors, (64), 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) [2024-11-28 03:54:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-28 03:54:28,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-28 03:54:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:54:28,980 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-28 03:54:28,980 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-28 03:54:28,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 64 transitions. [2024-11-28 03:54:28,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:54:28,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:54:28,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:54:28,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:28,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 03:54:28,983 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:54:28,985 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 03:54:28,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash -497968694, now seen corresponding path program 12 times [2024-11-28 03:54:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:28,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378375770] [2024-11-28 03:54:28,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:29,022 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:29,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:29,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 7 times [2024-11-28 03:54:29,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:29,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041586853] [2024-11-28 03:54:29,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:29,054 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:29,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash -921479074, now seen corresponding path program 13 times [2024-11-28 03:54:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498713492] [2024-11-28 03:54:29,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:54:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498713492] [2024-11-28 03:54:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498713492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:54:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568183528] [2024-11-28 03:54:30,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:30,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:54:30,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:54:30,487 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:54:30,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-28 03:54:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:30,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 03:54:30,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:54:30,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:54:30,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:54:30,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:30,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:54:31,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:31,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-28 03:54:32,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:32,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 03:54:32,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:32,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 03:54:33,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:33,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 03:54:33,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:54:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568183528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:54:35,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:54:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 32 [2024-11-28 03:54:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571758237] [2024-11-28 03:54:35,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:54:35,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:54:35,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:54:35,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 03:54:35,695 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. cyclomatic complexity: 6 Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 33 states have internal predecessors, (93), 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) [2024-11-28 03:54:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:54:41,521 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-11-28 03:54:41,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 132 transitions. [2024-11-28 03:54:41,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:54:41,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 132 transitions. [2024-11-28 03:54:41,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2024-11-28 03:54:41,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2024-11-28 03:54:41,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 132 transitions. [2024-11-28 03:54:41,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:54:41,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-28 03:54:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 132 transitions. [2024-11-28 03:54:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 82. [2024-11-28 03:54:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 81 states have internal predecessors, (89), 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) [2024-11-28 03:54:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-28 03:54:41,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-28 03:54:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-28 03:54:41,535 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-28 03:54:41,535 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-28 03:54:41,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 89 transitions. [2024-11-28 03:54:41,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-28 03:54:41,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:54:41,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:54:41,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:41,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:54:41,539 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:54:41,539 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:54:41,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1118670050, now seen corresponding path program 14 times [2024-11-28 03:54:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308951882] [2024-11-28 03:54:41,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:41,572 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:41,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:41,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 76241, now seen corresponding path program 6 times [2024-11-28 03:54:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35460766] [2024-11-28 03:54:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:41,605 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:54:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:54:41,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:54:41,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1648256336, now seen corresponding path program 15 times [2024-11-28 03:54:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:54:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700903531] [2024-11-28 03:54:41,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 03:54:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700903531] [2024-11-28 03:54:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700903531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:54:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31160381] [2024-11-28 03:54:44,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:54:44,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:54:44,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:54:44,626 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:54:44,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-28 03:54:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:54:44,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 03:54:44,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:54:44,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:54:44,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 03:54:45,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:54:45,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 03:54:45,521 INFO L349 Elim1Store]: treesize reduction 82, result has 24.1 percent of original size [2024-11-28 03:54:45,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 60 [2024-11-28 03:54:46,167 INFO L349 Elim1Store]: treesize reduction 197, result has 19.9 percent of original size [2024-11-28 03:54:46,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 74 treesize of output 88 [2024-11-28 03:54:47,085 INFO L349 Elim1Store]: treesize reduction 348, result has 17.1 percent of original size [2024-11-28 03:54:47,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 96 treesize of output 116 [2024-11-28 03:54:49,566 INFO L349 Elim1Store]: treesize reduction 375, result has 15.7 percent of original size [2024-11-28 03:54:49,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 42 case distinctions, treesize of input 105 treesize of output 119 [2024-11-28 03:54:51,620 INFO L349 Elim1Store]: treesize reduction 363, result has 18.4 percent of original size [2024-11-28 03:54:51,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 42 case distinctions, treesize of input 105 treesize of output 131 [2024-11-28 03:55:00,352 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 751 DAG size of output: 170 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:55:00,353 INFO L349 Elim1Store]: treesize reduction 1656, result has 18.5 percent of original size [2024-11-28 03:55:00,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 206 case distinctions, treesize of input 275 treesize of output 508 [2024-11-28 03:56:44,394 WARN L286 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 192 DAG size of output: 190 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:56:46,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:59:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31160381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:59:05,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:59:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13] total 39 [2024-11-28 03:59:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223955632] [2024-11-28 03:59:05,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:59:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 03:59:06,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 03:59:06,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1331, Unknown=11, NotChecked=0, Total=1560 [2024-11-28 03:59:06,068 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. cyclomatic complexity: 10 Second operand has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 40 states have internal predecessors, (95), 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) [2024-11-28 03:59:40,339 WARN L286 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 203 DAG size of output: 192 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:59:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:40,804 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-28 03:59:40,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 104 transitions. [2024-11-28 03:59:40,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:59:40,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 104 transitions. [2024-11-28 03:59:40,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2024-11-28 03:59:40,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2024-11-28 03:59:40,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 104 transitions. [2024-11-28 03:59:40,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 03:59:40,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-28 03:59:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 104 transitions. [2024-11-28 03:59:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-28 03:59:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 96 states have internal predecessors, (103), 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) [2024-11-28 03:59:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-28 03:59:40,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-28 03:59:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 03:59:40,814 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-28 03:59:40,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-28 03:59:40,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 103 transitions. [2024-11-28 03:59:40,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 03:59:40,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 03:59:40,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 03:59:40,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:40,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-28 03:59:40,816 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:59:40,816 INFO L749 eck$LassoCheckResult]: Loop: "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" [2024-11-28 03:59:40,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1647849366, now seen corresponding path program 16 times [2024-11-28 03:59:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:59:40,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83087232] [2024-11-28 03:59:40,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:59:40,841 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:59:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:59:40,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:59:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash 76241, now seen corresponding path program 7 times [2024-11-28 03:59:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:59:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099273155] [2024-11-28 03:59:40,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:59:40,871 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:59:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:59:40,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:59:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -395684324, now seen corresponding path program 17 times [2024-11-28 03:59:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 03:59:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866720687] [2024-11-28 03:59:40,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:59:40,903 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:59:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:59:40,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 03:59:49,540 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 204 DAG size of output: 153 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-28 03:59:50,632 INFO L204 LassoAnalysis]: Preferences: [2024-11-28 03:59:50,632 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-28 03:59:50,632 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-28 03:59:50,632 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-28 03:59:50,633 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-28 03:59:50,633 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:50,633 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-28 03:59:50,633 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-28 03:59:50,633 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration16_Lasso [2024-11-28 03:59:50,633 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-28 03:59:50,633 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-28 03:59:50,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:50,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:50,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:50,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:50,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:50,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:50,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:52,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:52,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:52,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:52,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 03:59:55,110 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-28 03:59:55,110 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-28 03:59:55,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,116 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-28 03:59:55,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:59:55,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:59:55,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:59:55,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-28 03:59:55,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,146 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-28 03:59:55,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:59:55,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:59:55,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:59:55,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-28 03:59:55,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,176 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-28 03:59:55,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:59:55,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:59:55,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:59:55,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-28 03:59:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,216 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-28 03:59:55,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:59:55,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:59:55,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:59:55,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-28 03:59:55,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,249 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-28 03:59:55,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:59:55,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:59:55,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:59:55,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-28 03:59:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,277 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-28 03:59:55,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-28 03:59:55,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-28 03:59:55,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-28 03:59:55,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-28 03:59:55,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,306 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-28 03:59:55,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:59:55,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:59:55,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-28 03:59:55,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,354 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-28 03:59:55,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:59:55,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:59:55,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-28 03:59:55,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,394 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-28 03:59:55,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:59:55,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:59:55,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-28 03:59:55,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-28 03:59:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,434 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-28 03:59:55,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-28 03:59:55,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-28 03:59:55,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-28 03:59:55,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-28 03:59:55,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-28 03:59:55,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-28 03:59:55,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-28 03:59:55,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-28 03:59:55,477 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-28 03:59:55,477 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-28 03:59:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 03:59:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:55,481 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 03:59:55,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-28 03:59:55,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-28 03:59:55,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-28 03:59:55,498 INFO L474 LassoAnalysis]: Proved termination. [2024-11-28 03:59:55,498 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-11-28 03:59:55,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-28 03:59:55,629 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-11-28 03:59:55,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-28 03:59:55,646 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-28 03:59:55,647 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-28 03:59:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:55,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:59:55,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:57,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:59:57,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:57,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 03:59:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:59:57,552 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2024-11-28 03:59:57,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 103 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-28 03:59:57,956 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 103 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) Result 97 states and 103 transitions. Complement of second has 5 states. [2024-11-28 03:59:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-28 03:59:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-28 03:59:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-28 03:59:57,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 40 letters. Loop has 3 letters. [2024-11-28 03:59:57,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 03:59:57,960 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-28 03:59:58,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:58,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:59:58,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:59,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:59:59,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:59,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 03:59:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:59:59,954 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2024-11-28 03:59:59,954 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 103 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-28 04:00:00,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-28 04:00:00,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 103 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) Result 97 states and 103 transitions. Complement of second has 5 states. [2024-11-28 04:00:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-28 04:00:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-28 04:00:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-28 04:00:00,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 40 letters. Loop has 3 letters. [2024-11-28 04:00:00,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 04:00:00,326 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-28 04:00:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:00,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 04:00:00,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:01,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:00:01,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:01,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 04:00:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:00:02,180 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2024-11-28 04:00:02,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 103 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-28 04:00:03,261 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 103 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) Result 115 states and 124 transitions. Complement of second has 13 states. [2024-11-28 04:00:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-28 04:00:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2024-11-28 04:00:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-11-28 04:00:03,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 40 letters. Loop has 3 letters. [2024-11-28 04:00:03,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 04:00:03,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 43 letters. Loop has 3 letters. [2024-11-28 04:00:03,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 04:00:03,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 40 letters. Loop has 6 letters. [2024-11-28 04:00:03,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-28 04:00:03,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 124 transitions. [2024-11-28 04:00:03,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-28 04:00:03,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 112 states and 121 transitions. [2024-11-28 04:00:03,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2024-11-28 04:00:03,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2024-11-28 04:00:03,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions. [2024-11-28 04:00:03,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-28 04:00:03,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-28 04:00:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions. [2024-11-28 04:00:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-11-28 04:00:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 106 states have internal predecessors, (116), 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) [2024-11-28 04:00:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2024-11-28 04:00:03,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-11-28 04:00:03,275 INFO L425 stractBuchiCegarLoop]: Abstraction has 107 states and 116 transitions. [2024-11-28 04:00:03,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-28 04:00:03,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 116 transitions. [2024-11-28 04:00:03,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 04:00:03,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 04:00:03,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 04:00:03,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:03,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 04:00:03,277 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 04:00:03,277 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 04:00:03,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -395684322, now seen corresponding path program 18 times [2024-11-28 04:00:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 04:00:03,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952418224] [2024-11-28 04:00:03,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 04:00:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952418224] [2024-11-28 04:00:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952418224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455610106] [2024-11-28 04:00:06,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:06,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:06,771 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:06,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-28 04:00:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:06,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 04:00:06,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:06,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:00:07,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 04:00:07,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 04:00:07,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:07,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-28 04:00:09,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:09,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:00:10,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:10,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:00:10,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:10,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:00:12,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:12,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:00:12,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:12,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 47 [2024-11-28 04:00:12,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455610106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:16,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 34 [2024-11-28 04:00:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396910028] [2024-11-28 04:00:16,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:16,113 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-28 04:00:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 8 times [2024-11-28 04:00:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 04:00:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211182627] [2024-11-28 04:00:16,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:16,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:00:16,117 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 04:00:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:00:16,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 04:00:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 04:00:16,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:00:16,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 04:00:16,426 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. cyclomatic complexity: 12 Second operand has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 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) [2024-11-28 04:00:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:26,071 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2024-11-28 04:00:26,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 164 transitions. [2024-11-28 04:00:26,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 04:00:26,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 147 states and 158 transitions. [2024-11-28 04:00:26,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2024-11-28 04:00:26,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2024-11-28 04:00:26,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 158 transitions. [2024-11-28 04:00:26,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-28 04:00:26,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-11-28 04:00:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 158 transitions. [2024-11-28 04:00:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 85. [2024-11-28 04:00:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 84 states have internal predecessors, (94), 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) [2024-11-28 04:00:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-28 04:00:26,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-28 04:00:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-28 04:00:26,085 INFO L425 stractBuchiCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-28 04:00:26,085 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-28 04:00:26,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 94 transitions. [2024-11-28 04:00:26,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-28 04:00:26,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 04:00:26,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 04:00:26,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:26,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-28 04:00:26,087 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1;" "assume !(main_~length~0#1 < 1);" "call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset;" "assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume main_~i~0#1 < main_~length~0#1;" "call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);" "main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;" "call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 04:00:26,087 INFO L749 eck$LassoCheckResult]: Loop: "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" [2024-11-28 04:00:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2090081426, now seen corresponding path program 19 times [2024-11-28 04:00:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 04:00:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022770020] [2024-11-28 04:00:26,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:29,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 04:00:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022770020] [2024-11-28 04:00:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022770020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777474743] [2024-11-28 04:00:29,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:29,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:29,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:29,287 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:29,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d6aab28-6254-4ce0-bffa-457dd17d852e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-28 04:00:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:29,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 04:00:29,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:29,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:00:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 04:00:30,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:30,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-28 04:00:30,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-28 04:00:31,190 INFO L349 Elim1Store]: treesize reduction 110, result has 24.1 percent of original size [2024-11-28 04:00:31,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 61 treesize of output 72 [2024-11-28 04:00:32,324 INFO L349 Elim1Store]: treesize reduction 241, result has 19.4 percent of original size [2024-11-28 04:00:32,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 83 treesize of output 100 [2024-11-28 04:00:33,934 INFO L349 Elim1Store]: treesize reduction 408, result has 16.6 percent of original size [2024-11-28 04:00:33,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 105 treesize of output 128 [2024-11-28 04:00:36,222 INFO L349 Elim1Store]: treesize reduction 611, result has 14.5 percent of original size [2024-11-28 04:00:36,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 127 treesize of output 156 [2024-11-28 04:00:41,262 INFO L349 Elim1Store]: treesize reduction 636, result has 12.8 percent of original size [2024-11-28 04:00:41,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 74 case distinctions, treesize of input 136 treesize of output 159 [2024-11-28 04:00:45,995 INFO L349 Elim1Store]: treesize reduction 636, result has 12.8 percent of original size [2024-11-28 04:00:45,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 74 case distinctions, treesize of input 136 treesize of output 159 [2024-11-28 04:00:48,948 INFO L349 Elim1Store]: treesize reduction 636, result has 12.8 percent of original size [2024-11-28 04:00:48,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 74 case distinctions, treesize of input 136 treesize of output 159 [2024-11-28 04:00:51,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:04:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777474743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:04:27,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:04:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 14] total 44 [2024-11-28 04:04:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062468427] [2024-11-28 04:04:27,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:04:27,061 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-28 04:04:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:04:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2476821, now seen corresponding path program 9 times [2024-11-28 04:04:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 04:04:27,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836329651] [2024-11-28 04:04:27,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:04:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:04:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:04:27,065 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 04:04:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:04:27,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 04:04:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 04:04:27,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 04:04:27,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1719, Unknown=15, NotChecked=0, Total=1980 [2024-11-28 04:04:27,444 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. cyclomatic complexity: 12 Second operand has 45 states, 44 states have (on average 2.659090909090909) internal successors, (117), 45 states have internal predecessors, (117), 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) [2024-11-28 04:04:53,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:05:06,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:05:35,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:05:43,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:06:17,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]