./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:38:49,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:38:50,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:38:50,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:38:50,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:38:50,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:38:50,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:38:50,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:38:50,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:38:50,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:38:50,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:38:50,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:38:50,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:38:50,105 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:38:50,105 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:38:50,106 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:38:50,106 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:38:50,109 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:38:50,109 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:38:50,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:38:50,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:38:50,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:38:50,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:38:50,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:38:50,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:38:50,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:38:50,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:38:50,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:38:50,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:38:50,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:38:50,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:38:50,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:38:50,113 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:38:50,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:38:50,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:38:50,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:38:50,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:38:50,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:38:50,114 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:38:50,115 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 [2024-11-20 22:38:50,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:38:50,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:38:50,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:38:50,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:38:50,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:38:50,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-20 22:38:51,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:38:51,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:38:51,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-20 22:38:51,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa8208f0/adc1488a3ec1433aa839d59175c4bcde/FLAGd3f6cc32f [2024-11-20 22:38:52,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa8208f0/adc1488a3ec1433aa839d59175c4bcde [2024-11-20 22:38:52,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:38:52,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:38:52,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:38:52,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:38:52,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:38:52,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275411cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52, skipping insertion in model container [2024-11-20 22:38:52,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:38:52,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:38:52,570 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:38:52,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:38:52,604 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:38:52,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52 WrapperNode [2024-11-20 22:38:52,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:38:52,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:38:52,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:38:52,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:38:52,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,642 INFO L138 Inliner]: procedures = 15, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2024-11-20 22:38:52,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:38:52,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:38:52,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:38:52,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:38:52,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,666 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-20 22:38:52,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:38:52,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:38:52,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:38:52,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:38:52,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (1/1) ... [2024-11-20 22:38:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:52,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:52,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:38:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 22:38:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 22:38:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 22:38:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:38:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:38:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:38:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:38:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:38:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:38:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:38:52,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:38:52,797 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:38:52,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:38:52,935 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-20 22:38:52,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:38:52,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:38:52,945 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 22:38:52,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:52 BoogieIcfgContainer [2024-11-20 22:38:52,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:38:52,946 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:38:52,947 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:38:52,950 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:38:52,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:38:52,950 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:38:52" (1/3) ... [2024-11-20 22:38:52,951 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40a6db01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:38:52, skipping insertion in model container [2024-11-20 22:38:52,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:38:52,952 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:52" (2/3) ... [2024-11-20 22:38:52,952 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40a6db01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:38:52, skipping insertion in model container [2024-11-20 22:38:52,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:38:52,952 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:52" (3/3) ... [2024-11-20 22:38:52,953 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1-2.c [2024-11-20 22:38:52,997 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:38:52,997 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:38:52,997 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:38:52,997 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:38:52,997 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:38:52,998 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:38:52,998 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:38:52,998 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:38:53,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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-20 22:38:53,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-20 22:38:53,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:53,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:53,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-20 22:38:53,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:38:53,026 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:38:53,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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-20 22:38:53,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-20 22:38:53,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:53,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:53,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-20 22:38:53,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:38:53,038 INFO L745 eck$LassoCheckResult]: Stem: 25#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13#L15true assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 24#L20-3true [2024-11-20 22:38:53,039 INFO L747 eck$LassoCheckResult]: Loop: 24#L20-3true assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 8#L20-2true main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 24#L20-3true [2024-11-20 22:38:53,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-20 22:38:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608161292] [2024-11-20 22:38:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-20 22:38:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346459471] [2024-11-20 22:38:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-20 22:38:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858407244] [2024-11-20 22:38:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:53,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:53,618 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:38:53,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:38:53,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:38:53,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:38:53,619 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:38:53,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:53,619 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:38:53,619 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:38:53,619 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration1_Lasso [2024-11-20 22:38:53,619 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:38:53,619 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:38:53,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:53,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:54,312 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:38:54,315 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:38:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:38:54,323 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-20 22:38:54,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:38:54,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:38:54,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:38:54,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:38:54,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:38:54,349 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-20 22:38:54,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:54,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:54,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-20 22:38:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-20 22:38:54,377 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-20 22:38:54,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:54,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:54,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-20 22:38:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:38:54,408 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-20 22:38:54,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:38:54,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:38:54,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:38:54,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:38:54,443 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-20 22:38:54,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:38:54,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:38:54,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:38:54,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:38:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:38:54,469 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-20 22:38:54,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:38:54,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:38:54,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:38:54,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:54,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:38:54,497 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-20 22:38:54,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:54,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:54,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-20 22:38:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:38:54,524 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-20 22:38:54,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:54,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:54,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:54,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-20 22:38:54,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,565 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:38:54,567 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-20 22:38:54,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:54,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:54,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:54,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:54,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:54,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:54,597 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:38:54,626 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-20 22:38:54,626 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:38:54,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:54,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:54,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:38:54,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:38:54,653 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-20 22:38:54,653 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:38:54,654 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~#v~0#1.offset >= 0] [2024-11-20 22:38:54,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:38:54,681 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-20 22:38:54,691 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:38:54,692 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:38:54,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:54,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:38:54,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:54,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:38:54,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:54,771 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-20 22:38:54,796 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:38:54,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-20 22:38:54,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 50 states and 71 transitions. Complement of second has 6 states. [2024-11-20 22:38:54,851 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-20 22:38:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-20 22:38:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-20 22:38:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-20 22:38:54,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:54,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-20 22:38:54,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:54,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-20 22:38:54,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:54,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2024-11-20 22:38:54,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-20 22:38:54,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 22 states and 31 transitions. [2024-11-20 22:38:54,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-20 22:38:54,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-20 22:38:54,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-11-20 22:38:54,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:54,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-20 22:38:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-11-20 22:38:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-20 22:38:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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-20 22:38:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2024-11-20 22:38:54,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-20 22:38:54,902 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-20 22:38:54,902 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:38:54,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2024-11-20 22:38:54,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-20 22:38:54,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:54,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:54,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-20 22:38:54,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:54,903 INFO L745 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 149#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 150#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 157#L20-4 main_~j~0#1 := 1; 156#L22-3 [2024-11-20 22:38:54,903 INFO L747 eck$LassoCheckResult]: Loop: 156#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 158#L25-5 assume !true; 146#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 155#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 156#L22-3 [2024-11-20 22:38:54,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2024-11-20 22:38:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301579648] [2024-11-20 22:38:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:54,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1841148, now seen corresponding path program 1 times [2024-11-20 22:38:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540375495] [2024-11-20 22:38:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:54,973 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-20 22:38:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540375495] [2024-11-20 22:38:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540375495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:54,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 22:38:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975804790] [2024-11-20 22:38:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:54,976 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:38:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 22:38:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 22:38:54,978 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 12 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-20 22:38:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:54,981 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-11-20 22:38:54,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-11-20 22:38:54,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:54,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-11-20 22:38:54,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-20 22:38:54,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-20 22:38:54,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-20 22:38:54,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:54,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-20 22:38:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-20 22:38:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-20 22:38:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 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-20 22:38:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-20 22:38:54,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-20 22:38:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 22:38:54,985 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-20 22:38:54,985 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:38:54,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-20 22:38:54,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:54,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:54,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:54,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-20 22:38:54,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:38:54,986 INFO L745 eck$LassoCheckResult]: Stem: 210#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 196#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 197#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 205#L20-4 main_~j~0#1 := 1; 204#L22-3 [2024-11-20 22:38:54,986 INFO L747 eck$LassoCheckResult]: Loop: 204#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 206#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 198#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 193#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 194#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 203#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 204#L22-3 [2024-11-20 22:38:54,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 2 times [2024-11-20 22:38:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:54,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145857431] [2024-11-20 22:38:54,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:54,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 1 times [2024-11-20 22:38:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028315504] [2024-11-20 22:38:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash -823994471, now seen corresponding path program 1 times [2024-11-20 22:38:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202609580] [2024-11-20 22:38:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:55,143 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-20 22:38:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202609580] [2024-11-20 22:38:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202609580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 22:38:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753237981] [2024-11-20 22:38:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:55,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:38:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:38:55,281 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-20 22:38:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:55,314 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-20 22:38:55,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2024-11-20 22:38:55,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:55,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 26 transitions. [2024-11-20 22:38:55,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-20 22:38:55,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-20 22:38:55,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-11-20 22:38:55,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:55,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-20 22:38:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-11-20 22:38:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-20 22:38:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-20 22:38:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-20 22:38:55,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-20 22:38:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:38:55,321 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-20 22:38:55,321 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:38:55,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-20 22:38:55,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:55,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:55,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:55,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:55,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:38:55,322 INFO L745 eck$LassoCheckResult]: Stem: 265#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 252#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 253#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 263#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 264#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 260#L20-4 main_~j~0#1 := 1; 258#L22-3 [2024-11-20 22:38:55,322 INFO L747 eck$LassoCheckResult]: Loop: 258#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 261#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 251#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 248#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 249#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 257#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 258#L22-3 [2024-11-20 22:38:55,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2024-11-20 22:38:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858305393] [2024-11-20 22:38:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 2 times [2024-11-20 22:38:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055137434] [2024-11-20 22:38:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -48611717, now seen corresponding path program 1 times [2024-11-20 22:38:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749148660] [2024-11-20 22:38:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749148660] [2024-11-20 22:38:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749148660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557028116] [2024-11-20 22:38:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:55,530 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:38:55,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 22:38:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:55,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:38:55,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:55,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557028116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:55,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-20 22:38:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917862135] [2024-11-20 22:38:55,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 22:38:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 22:38:55,824 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-20 22:38:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:55,880 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-11-20 22:38:55,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2024-11-20 22:38:55,881 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-11-20 22:38:55,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2024-11-20 22:38:55,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-20 22:38:55,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-20 22:38:55,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2024-11-20 22:38:55,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:55,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-20 22:38:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2024-11-20 22:38:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-11-20 22:38:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-20 22:38:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-20 22:38:55,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-20 22:38:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:38:55,886 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-20 22:38:55,886 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:38:55,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-11-20 22:38:55,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:55,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:55,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:55,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:55,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:38:55,887 INFO L745 eck$LassoCheckResult]: Stem: 413#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 396#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 397#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 409#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 414#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 405#L20-4 main_~j~0#1 := 1; 406#L22-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 400#L22-4 main_~k~0#1 := 1; 401#L32-3 [2024-11-20 22:38:55,887 INFO L747 eck$LassoCheckResult]: Loop: 401#L32-3 assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 408#L6 assume !(0 == __VERIFIER_assert_~cond#1); 391#L6-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 392#L32-2 main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 401#L32-3 [2024-11-20 22:38:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243825, now seen corresponding path program 1 times [2024-11-20 22:38:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754374650] [2024-11-20 22:38:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,902 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 1 times [2024-11-20 22:38:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290931200] [2024-11-20 22:38:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:55,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -78992900, now seen corresponding path program 1 times [2024-11-20 22:38:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52472029] [2024-11-20 22:38:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:56,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52472029] [2024-11-20 22:38:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52472029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513421912] [2024-11-20 22:38:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:56,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:38:56,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 22:38:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:56,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:38:56,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 22:38:56,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 22:38:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513421912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 22:38:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-20 22:38:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284521898] [2024-11-20 22:38:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:38:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 22:38:56,187 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-20 22:38:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:56,204 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-20 22:38:56,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2024-11-20 22:38:56,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-20 22:38:56,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 38 transitions. [2024-11-20 22:38:56,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-20 22:38:56,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-20 22:38:56,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-20 22:38:56,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:38:56,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-20 22:38:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-20 22:38:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-11-20 22:38:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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-20 22:38:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-20 22:38:56,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-20 22:38:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 22:38:56,208 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-20 22:38:56,208 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:38:56,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-20 22:38:56,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:56,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:56,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:56,209 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:56,209 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-20 22:38:56,209 INFO L745 eck$LassoCheckResult]: Stem: 519#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 503#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 504#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 516#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 517#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 518#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 520#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 512#L20-4 main_~j~0#1 := 1; 513#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 514#L25-5 [2024-11-20 22:38:56,209 INFO L747 eck$LassoCheckResult]: Loop: 514#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 505#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 500#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 502#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 506#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 514#L25-5 [2024-11-20 22:38:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -873401203, now seen corresponding path program 1 times [2024-11-20 22:38:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094591617] [2024-11-20 22:38:56,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 61175917, now seen corresponding path program 1 times [2024-11-20 22:38:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739113504] [2024-11-20 22:38:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2064874337, now seen corresponding path program 1 times [2024-11-20 22:38:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:56,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110246019] [2024-11-20 22:38:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:56,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:56,747 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:38:56,749 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:38:56,749 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:38:56,749 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:38:56,749 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:38:56,749 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:56,749 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:38:56,750 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:38:56,750 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration6_Lasso [2024-11-20 22:38:56,750 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:38:56,750 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:38:56,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:56,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:57,284 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:38:57,284 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:38:57,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,289 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:38:57,295 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-20 22:38:57,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-20 22:38:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,326 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:38:57,328 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-20 22:38:57,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:57,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,381 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:38:57,387 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-20 22:38:57,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:57,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,412 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:38:57,415 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-20 22:38:57,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-20 22:38:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,449 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:38:57,451 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-20 22:38:57,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:57,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,474 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:38:57,477 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-20 22:38:57,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-20 22:38:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,503 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:38:57,508 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-20 22:38:57,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,539 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-20 22:38:57,541 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-20 22:38:57,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:38:57,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-20 22:38:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,567 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:38:57,575 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-20 22:38:57,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:38:57,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:38:57,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:38:57,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:38:57,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:38:57,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:38:57,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:38:57,596 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-20 22:38:57,596 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-20 22:38:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:57,598 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:38:57,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:38:57,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:38:57,612 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:38:57,612 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:38:57,612 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-20 22:38:57,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:57,649 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-20 22:38:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:57,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:38:57,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:57,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:38:57,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:57,815 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-20 22:38:57,816 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-20 22:38:57,816 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-20 22:38:57,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 39 states and 51 transitions. Complement of second has 9 states. [2024-11-20 22:38:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-20 22:38:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-20 22:38:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-20 22:38:57,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-20 22:38:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:57,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2024-11-20 22:38:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:57,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2024-11-20 22:38:57,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:38:57,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2024-11-20 22:38:57,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:57,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 45 transitions. [2024-11-20 22:38:57,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-20 22:38:57,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-20 22:38:57,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2024-11-20 22:38:57,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:38:57,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-20 22:38:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2024-11-20 22:38:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-20 22:38:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 states have internal predecessors, (41), 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-20 22:38:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-20 22:38:57,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-20 22:38:57,895 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-20 22:38:57,895 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:38:57,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2024-11-20 22:38:57,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:57,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:57,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:57,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:57,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:38:57,897 INFO L745 eck$LassoCheckResult]: Stem: 683#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 664#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 665#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 680#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 681#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 682#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 686#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 677#L20-4 main_~j~0#1 := 1; 678#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 684#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 662#L25-1 assume !main_#t~short9#1; 658#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 659#L25-6 [2024-11-20 22:38:57,897 INFO L747 eck$LassoCheckResult]: Loop: 659#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 671#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 672#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 674#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 675#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 685#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 659#L25-6 [2024-11-20 22:38:57,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash -583325479, now seen corresponding path program 1 times [2024-11-20 22:38:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535268798] [2024-11-20 22:38:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 22:38:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535268798] [2024-11-20 22:38:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535268798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:38:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:38:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 22:38:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942100352] [2024-11-20 22:38:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:38:57,950 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:38:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 3 times [2024-11-20 22:38:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582408668] [2024-11-20 22:38:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:57,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:57,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 22:38:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 22:38:58,100 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-20 22:38:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:58,144 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-20 22:38:58,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2024-11-20 22:38:58,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:38:58,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2024-11-20 22:38:58,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-20 22:38:58,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:38:58,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-11-20 22:38:58,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:38:58,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-20 22:38:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-11-20 22:38:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-20 22:38:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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-20 22:38:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-20 22:38:58,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-20 22:38:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:38:58,151 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-20 22:38:58,151 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:38:58,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2024-11-20 22:38:58,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:58,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:58,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:58,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:58,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:38:58,153 INFO L745 eck$LassoCheckResult]: Stem: 769#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 748#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 749#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 766#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 767#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 768#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 771#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 762#L20-4 main_~j~0#1 := 1; 763#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 758#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 746#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 742#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 743#L25-6 [2024-11-20 22:38:58,154 INFO L747 eck$LassoCheckResult]: Loop: 743#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 755#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 756#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 765#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 772#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 770#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 743#L25-6 [2024-11-20 22:38:58,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash -583325541, now seen corresponding path program 1 times [2024-11-20 22:38:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917188297] [2024-11-20 22:38:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 4 times [2024-11-20 22:38:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587681179] [2024-11-20 22:38:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 678523240, now seen corresponding path program 2 times [2024-11-20 22:38:58,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:58,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500906019] [2024-11-20 22:38:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:38:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:58,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:38:58,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500906019] [2024-11-20 22:38:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500906019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:38:58,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038235722] [2024-11-20 22:38:58,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:38:58,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:38:58,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:38:58,320 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:38:58,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-20 22:38:58,366 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:38:58,366 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:38:58,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:38:58,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:38:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:58,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:38:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:38:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038235722] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:38:58,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:38:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-20 22:38:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531776377] [2024-11-20 22:38:58,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:38:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:38:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:38:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:38:58,627 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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-20 22:38:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:38:58,716 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-11-20 22:38:58,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2024-11-20 22:38:58,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-11-20 22:38:58,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 86 transitions. [2024-11-20 22:38:58,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-20 22:38:58,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-20 22:38:58,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2024-11-20 22:38:58,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:38:58,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-20 22:38:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2024-11-20 22:38:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2024-11-20 22:38:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.32) internal successors, (66), 49 states have internal predecessors, (66), 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-20 22:38:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-11-20 22:38:58,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-20 22:38:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:38:58,727 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-20 22:38:58,727 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:38:58,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2024-11-20 22:38:58,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-20 22:38:58,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:38:58,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:38:58,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:38:58,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:38:58,730 INFO L745 eck$LassoCheckResult]: Stem: 997#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 982#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 971#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 972#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 994#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 995#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 996#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1000#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1001#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1013#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1012#L20-4 main_~j~0#1 := 1; 1011#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1009#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1006#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 967#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 968#L25-6 [2024-11-20 22:38:58,730 INFO L747 eck$LassoCheckResult]: Loop: 968#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 983#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 984#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 993#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1003#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1002#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 968#L25-6 [2024-11-20 22:38:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1530158845, now seen corresponding path program 2 times [2024-11-20 22:38:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:58,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344613476] [2024-11-20 22:38:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:38:58,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:58,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 5 times [2024-11-20 22:38:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:58,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084432437] [2024-11-20 22:38:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:38:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1481430602, now seen corresponding path program 3 times [2024-11-20 22:38:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:38:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291397142] [2024-11-20 22:38:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:38:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:38:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:38:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:38:58,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:38:59,430 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:38:59,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:38:59,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:38:59,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:38:59,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:38:59,431 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:38:59,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:38:59,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:38:59,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration9_Lasso [2024-11-20 22:38:59,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:38:59,431 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:38:59,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:38:59,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:00,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:39:00,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:39:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,098 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-20 22:39:00,100 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-20 22:39:00,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,123 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-20 22:39:00,126 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-20 22:39:00,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,152 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-20 22:39:00,155 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-20 22:39:00,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,174 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:39:00,176 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-20 22:39:00,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,197 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:39:00,199 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-20 22:39:00,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-20 22:39:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,220 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:39:00,222 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-20 22:39:00,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-20 22:39:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,266 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:39:00,268 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-20 22:39:00,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,286 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:39:00,288 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-20 22:39:00,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,308 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:39:00,310 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-20 22:39:00,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,322 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-20 22:39:00,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,329 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-20 22:39:00,331 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-20 22:39:00,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,350 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-20 22:39:00,352 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-20 22:39:00,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-20 22:39:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,386 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-20 22:39:00,388 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-20 22:39:00,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-20 22:39:00,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,417 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-20 22:39:00,419 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-20 22:39:00,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,440 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-20 22:39:00,443 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-20 22:39:00,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,465 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-20 22:39:00,468 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-20 22:39:00,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-20 22:39:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,496 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-20 22:39:00,498 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-20 22:39:00,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,524 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-20 22:39:00,528 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-20 22:39:00,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:00,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:00,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:00,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:00,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,548 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-20 22:39:00,551 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-20 22:39:00,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:00,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:00,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:00,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:00,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:00,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:00,578 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:39:00,593 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-20 22:39:00,593 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-20 22:39:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:00,600 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:00,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-20 22:39:00,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:39:00,620 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:39:00,620 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:39:00,620 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_3) = -1*ULTIMATE.start_main_~#v~0#1.offset - 4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_3 Supporting invariants [] [2024-11-20 22:39:00,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:00,649 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-20 22:39:00,650 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-20 22:39:00,651 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:39:00,651 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:39:00,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:00,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:00,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:00,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:39:00,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:00,862 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-20 22:39:00,863 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-20 22:39:00,863 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 21 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-20 22:39:01,000 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 21. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 94 states and 126 transitions. Complement of second has 11 states. [2024-11-20 22:39:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2024-11-20 22:39:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-20 22:39:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2024-11-20 22:39:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-20 22:39:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 21 letters. Loop has 6 letters. [2024-11-20 22:39:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 12 letters. [2024-11-20 22:39:01,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:01,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 126 transitions. [2024-11-20 22:39:01,004 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-20 22:39:01,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 92 states and 124 transitions. [2024-11-20 22:39:01,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-20 22:39:01,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-20 22:39:01,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 124 transitions. [2024-11-20 22:39:01,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:01,005 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-11-20 22:39:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 124 transitions. [2024-11-20 22:39:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2024-11-20 22:39:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 65 states have internal predecessors, (90), 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-20 22:39:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-11-20 22:39:01,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-20 22:39:01,008 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-20 22:39:01,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:39:01,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 90 transitions. [2024-11-20 22:39:01,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-20 22:39:01,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:01,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:01,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:01,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:39:01,009 INFO L745 eck$LassoCheckResult]: Stem: 1283#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 1266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1255#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 1256#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1278#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1279#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1280#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1292#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1291#L20-4 main_~j~0#1 := 1; 1284#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1267#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1253#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1249#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1250#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1262#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1263#L22-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1260#L22-4 main_~k~0#1 := 1; 1261#L32-3 [2024-11-20 22:39:01,010 INFO L747 eck$LassoCheckResult]: Loop: 1261#L32-3 assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1274#L6 assume !(0 == __VERIFIER_assert_~cond#1); 1247#L6-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1248#L32-2 main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1261#L32-3 [2024-11-20 22:39:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash 67745056, now seen corresponding path program 1 times [2024-11-20 22:39:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052278456] [2024-11-20 22:39:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:01,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:01,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:01,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 2 times [2024-11-20 22:39:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:01,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194417681] [2024-11-20 22:39:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:01,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:01,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -804574741, now seen corresponding path program 1 times [2024-11-20 22:39:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296881741] [2024-11-20 22:39:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:01,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:01,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:02,227 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:39:02,228 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:39:02,228 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:39:02,228 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:39:02,228 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:39:02,228 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,228 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:39:02,228 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:39:02,228 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration10_Lasso [2024-11-20 22:39:02,228 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:39:02,228 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:39:02,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:02,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:02,809 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:39:02,809 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:39:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,815 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:02,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-20 22:39:02,816 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-20 22:39:02,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:02,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:02,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:02,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:02,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:02,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:02,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:02,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:02,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:02,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,835 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:02,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-20 22:39:02,837 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-20 22:39:02,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:02,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:02,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:02,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:02,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:02,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:02,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:02,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:02,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-20 22:39:02,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,855 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:02,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-20 22:39:02,857 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-20 22:39:02,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:02,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:02,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:02,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:02,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:02,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:02,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:02,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:02,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-20 22:39:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,880 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:02,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-20 22:39:02,881 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-20 22:39:02,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:02,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:02,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:02,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:02,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:02,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:02,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:02,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:02,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:02,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,900 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:02,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-20 22:39:02,905 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-20 22:39:02,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:02,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:02,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:02,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:02,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:02,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:02,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:39:02,948 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-20 22:39:02,949 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:39:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:02,950 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:02,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-20 22:39:02,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:39:02,963 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:39:02,963 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:39:02,963 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~k~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4) = -1*ULTIMATE.start_main_~#v~0#1.offset - 4*ULTIMATE.start_main_~k~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4 Supporting invariants [] [2024-11-20 22:39:02,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-20 22:39:02,980 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-20 22:39:02,981 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-20 22:39:02,981 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:39:02,981 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:39:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:03,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:03,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:03,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:03,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:03,056 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-20 22:39:03,057 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:39:03,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 90 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-20 22:39:03,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 90 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) Result 70 states and 95 transitions. Complement of second has 4 states. [2024-11-20 22:39:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:39:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-20 22:39:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-11-20 22:39:03,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-20 22:39:03,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:03,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-20 22:39:03,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:03,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 8 letters. [2024-11-20 22:39:03,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:03,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2024-11-20 22:39:03,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:39:03,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 46 states and 61 transitions. [2024-11-20 22:39:03,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-20 22:39:03,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-20 22:39:03,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 61 transitions. [2024-11-20 22:39:03,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:03,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-20 22:39:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 61 transitions. [2024-11-20 22:39:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 22:39:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 45 states have internal predecessors, (61), 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-20 22:39:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-11-20 22:39:03,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-20 22:39:03,074 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-20 22:39:03,074 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:39:03,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2024-11-20 22:39:03,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:39:03,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:03,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:03,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:03,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-20 22:39:03,075 INFO L745 eck$LassoCheckResult]: Stem: 1515#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 1498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1489#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 1490#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1512#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1513#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1514#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1522#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1519#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1518#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1507#L20-4 main_~j~0#1 := 1; 1508#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1526#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1525#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1523#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1509#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1501#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1502#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1516#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1527#L25-1 [2024-11-20 22:39:03,075 INFO L747 eck$LassoCheckResult]: Loop: 1527#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1485#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1486#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1529#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 1528#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1527#L25-1 [2024-11-20 22:39:03,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -606279004, now seen corresponding path program 4 times [2024-11-20 22:39:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011353328] [2024-11-20 22:39:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:03,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:03,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash 64187797, now seen corresponding path program 2 times [2024-11-20 22:39:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:03,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203482377] [2024-11-20 22:39:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:03,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:03,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1784762158, now seen corresponding path program 1 times [2024-11-20 22:39:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183437730] [2024-11-20 22:39:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:03,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:03,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:03,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-20 22:39:03,910 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:39:03,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:39:03,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:39:03,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:39:03,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:39:03,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:03,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:39:03,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:39:03,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration11_Lasso [2024-11-20 22:39:03,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:39:03,910 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:39:03,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:03,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:03,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:03,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:03,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:03,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:03,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:04,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:39:04,532 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:39:04,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,534 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-20 22:39:04,535 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-20 22:39:04,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:04,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:04,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-20 22:39:04,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,558 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,562 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-20 22:39:04,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-20 22:39:04,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:04,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:04,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,585 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-20 22:39:04,587 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-20 22:39:04,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:04,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:04,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:04,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,607 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-20 22:39:04,609 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-20 22:39:04,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:04,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:04,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:04,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,628 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-20 22:39:04,629 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-20 22:39:04,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:04,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:04,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:04,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,649 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-20 22:39:04,651 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-20 22:39:04,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:04,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:04,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-20 22:39:04,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,672 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-20 22:39:04,674 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-20 22:39:04,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:04,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:04,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:04,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,693 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-20 22:39:04,695 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-20 22:39:04,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:04,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:04,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,718 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-20 22:39:04,720 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-20 22:39:04,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:04,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:04,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:04,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:04,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,742 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-20 22:39:04,744 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-20 22:39:04,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:04,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:04,755 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:39:04,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:04,763 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-20 22:39:04,763 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-20 22:39:04,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:39:04,827 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-11-20 22:39:04,827 INFO L444 ModelExtractionUtils]: 12 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-20 22:39:04,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:04,830 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:04,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-20 22:39:04,831 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:39:04,843 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-20 22:39:04,843 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:39:04,843 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~#v~0#1.offset + 4*ULTIMATE.start_main_~i~0#1 + 2 Supporting invariants [] [2024-11-20 22:39:04,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:04,858 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-20 22:39:04,859 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-20 22:39:04,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:04,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:04,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:04,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:04,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:04,943 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-20 22:39:04,944 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-20 22:39:04,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 22:39:04,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) Result 68 states and 90 transitions. Complement of second has 7 states. [2024-11-20 22:39:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:39:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 22:39:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-20 22:39:04,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-20 22:39:04,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:04,977 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:39:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:05,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:05,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:05,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:05,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:05,066 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-20 22:39:05,067 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-20 22:39:05,067 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 22:39:05,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) Result 73 states and 99 transitions. Complement of second has 9 states. [2024-11-20 22:39:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-20 22:39:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 22:39:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2024-11-20 22:39:05,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-20 22:39:05,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:05,097 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:39:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:05,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:05,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:05,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:05,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:05,177 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-20 22:39:05,178 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-20 22:39:05,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 22:39:05,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) Result 121 states and 175 transitions. Complement of second has 9 states. [2024-11-20 22:39:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:39:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 22:39:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2024-11-20 22:39:05,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-20 22:39:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:05,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 24 letters. Loop has 5 letters. [2024-11-20 22:39:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:05,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 10 letters. [2024-11-20 22:39:05,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:05,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 175 transitions. [2024-11-20 22:39:05,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2024-11-20 22:39:05,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 101 states and 139 transitions. [2024-11-20 22:39:05,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-20 22:39:05,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-20 22:39:05,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 139 transitions. [2024-11-20 22:39:05,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:05,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 139 transitions. [2024-11-20 22:39:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 139 transitions. [2024-11-20 22:39:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2024-11-20 22:39:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 86 states have internal predecessors, (121), 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-20 22:39:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-20 22:39:05,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-20 22:39:05,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-20 22:39:05,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-20 22:39:05,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 121 transitions. [2024-11-20 22:39:05,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-20 22:39:05,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:05,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:05,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:05,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:39:05,210 INFO L745 eck$LassoCheckResult]: Stem: 2108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 2089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2083#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 2084#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2104#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2105#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2106#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2107#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2112#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2111#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2098#L20-4 main_~j~0#1 := 1; 2099#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2115#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2116#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2146#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2142#L26 assume !(main_~i~0#1 < 2); 2138#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 2139#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2080#L25-1 assume !main_#t~short9#1; 2076#L25-3 [2024-11-20 22:39:05,210 INFO L747 eck$LassoCheckResult]: Loop: 2076#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2077#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2090#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2091#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2109#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2134#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2076#L25-3 [2024-11-20 22:39:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -604616314, now seen corresponding path program 1 times [2024-11-20 22:39:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281352157] [2024-11-20 22:39:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 22:39:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281352157] [2024-11-20 22:39:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281352157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:39:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:39:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:39:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776315156] [2024-11-20 22:39:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:39:05,237 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:39:05,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 6 times [2024-11-20 22:39:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290176721] [2024-11-20 22:39:05,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:05,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 22:39:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 22:39:05,398 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. cyclomatic complexity: 41 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-20 22:39:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:05,422 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2024-11-20 22:39:05,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 117 transitions. [2024-11-20 22:39:05,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-20 22:39:05,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 84 states and 114 transitions. [2024-11-20 22:39:05,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-20 22:39:05,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-20 22:39:05,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 114 transitions. [2024-11-20 22:39:05,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:05,423 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 114 transitions. [2024-11-20 22:39:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 114 transitions. [2024-11-20 22:39:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-20 22:39:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 77 states have internal predecessors, (108), 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-20 22:39:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-20 22:39:05,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-20 22:39:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 22:39:05,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-20 22:39:05,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-20 22:39:05,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 108 transitions. [2024-11-20 22:39:05,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-20 22:39:05,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:05,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:05,428 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:05,428 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:39:05,428 INFO L745 eck$LassoCheckResult]: Stem: 2290#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 2276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2267#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 2268#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2287#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2288#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2289#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2296#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2294#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2293#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2277#L20-4 main_~j~0#1 := 1; 2278#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2304#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2305#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2325#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2323#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2322#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 2320#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2263#L25-1 assume !main_#t~short9#1; 2264#L25-3 [2024-11-20 22:39:05,428 INFO L747 eck$LassoCheckResult]: Loop: 2264#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2297#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2272#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2273#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2291#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2336#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2264#L25-3 [2024-11-20 22:39:05,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash -604675896, now seen corresponding path program 1 times [2024-11-20 22:39:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:05,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865459462] [2024-11-20 22:39:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 7 times [2024-11-20 22:39:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924836870] [2024-11-20 22:39:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:05,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1188823131, now seen corresponding path program 1 times [2024-11-20 22:39:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115837752] [2024-11-20 22:39:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:05,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:05,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-20 22:39:06,208 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:39:06,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:39:06,208 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:39:06,208 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:39:06,208 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:39:06,208 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,208 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:39:06,208 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:39:06,208 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration13_Lasso [2024-11-20 22:39:06,209 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:39:06,209 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:39:06,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:39:06,866 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:39:06,866 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:39:06,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:06,868 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:06,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-20 22:39:06,873 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-20 22:39:06,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:06,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:06,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:06,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:06,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:06,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:06,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:06,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:06,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-20 22:39:06,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:06,892 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:06,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-20 22:39:06,894 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-20 22:39:06,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:06,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:06,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:06,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:06,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:06,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:06,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:06,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:06,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:06,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:06,914 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:06,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-20 22:39:06,915 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-20 22:39:06,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:06,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:06,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:06,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:06,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:06,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:06,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:06,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:06,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:06,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:06,934 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:06,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-20 22:39:06,936 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-20 22:39:06,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:06,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:06,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:06,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:06,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:06,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:06,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:06,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-20 22:39:06,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:06,958 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:06,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-20 22:39:06,960 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-20 22:39:06,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:06,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:06,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:06,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:06,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:06,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:06,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:06,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-20 22:39:06,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:06,982 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:06,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-20 22:39:06,984 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-20 22:39:06,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:06,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:39:06,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:06,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:06,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:06,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:39:06,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:39:06,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:07,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:07,002 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:07,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-20 22:39:07,004 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-20 22:39:07,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:07,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:07,015 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:39:07,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:07,023 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-20 22:39:07,023 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-20 22:39:07,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:07,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:07,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:07,047 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:07,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-20 22:39:07,049 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-20 22:39:07,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:07,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:07,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:07,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:07,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:07,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:07,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:39:07,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:07,071 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:07,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-20 22:39:07,072 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-20 22:39:07,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:39:07,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:39:07,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:39:07,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:39:07,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:39:07,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:39:07,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:39:07,115 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-20 22:39:07,116 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-20 22:39:07,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:39:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:07,118 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:39:07,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-20 22:39:07,141 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:39:07,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:39:07,153 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:39:07,153 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_6, ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_6 - 1*ULTIMATE.start_main_~#v~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-20 22:39:07,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:07,175 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-20 22:39:07,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-20 22:39:07,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:39:07,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:39:07,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:07,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:39:07,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:07,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:39:07,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:07,252 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-20 22:39:07,253 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-20 22:39:07,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 108 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-20 22:39:07,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 108 transitions. cyclomatic complexity: 36. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 205 states and 307 transitions. Complement of second has 6 states. [2024-11-20 22:39:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:39:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-20 22:39:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-20 22:39:07,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 6 letters. [2024-11-20 22:39:07,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:07,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 25 letters. Loop has 6 letters. [2024-11-20 22:39:07,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:07,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 12 letters. [2024-11-20 22:39:07,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:39:07,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 307 transitions. [2024-11-20 22:39:07,293 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2024-11-20 22:39:07,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 150 states and 219 transitions. [2024-11-20 22:39:07,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-20 22:39:07,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-20 22:39:07,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 219 transitions. [2024-11-20 22:39:07,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:39:07,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-11-20 22:39:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 219 transitions. [2024-11-20 22:39:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 110. [2024-11-20 22:39:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 109 states have internal predecessors, (161), 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-20 22:39:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-20 22:39:07,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-20 22:39:07,298 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-20 22:39:07,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-20 22:39:07,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 161 transitions. [2024-11-20 22:39:07,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-20 22:39:07,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:39:07,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:39:07,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:39:07,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:39:07,307 INFO L745 eck$LassoCheckResult]: Stem: 2697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 2680#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2676#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 2677#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2693#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2694#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2695#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2696#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2703#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2702#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2688#L20-4 main_~j~0#1 := 1; 2689#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2708#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2709#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2719#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2716#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2717#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 2710#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2712#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2701#L25-3 [2024-11-20 22:39:07,307 INFO L747 eck$LassoCheckResult]: Loop: 2701#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2700#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2681#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2682#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2698#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2713#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2701#L25-3 [2024-11-20 22:39:07,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -604675898, now seen corresponding path program 2 times [2024-11-20 22:39:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:07,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932764962] [2024-11-20 22:39:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:39:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 22:39:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:39:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932764962] [2024-11-20 22:39:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932764962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:39:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900492700] [2024-11-20 22:39:07,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:39:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:39:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:39:07,407 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:39:07,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2024-11-20 22:39:07,478 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:39:07,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:39:07,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:39:07,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:39:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 22:39:07,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:39:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 22:39:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900492700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:39:07,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:39:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-20 22:39:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401964883] [2024-11-20 22:39:07,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:39:07,520 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:39:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:39:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 8 times [2024-11-20 22:39:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:39:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514277682] [2024-11-20 22:39:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:39:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:39:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:07,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:39:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:39:07,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:39:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:39:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:39:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:39:07,728 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. cyclomatic complexity: 60 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-20 22:39:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:39:07,801 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-11-20 22:39:07,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 87 transitions. [2024-11-20 22:39:07,802 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:39:07,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2024-11-20 22:39:07,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-20 22:39:07,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-20 22:39:07,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-20 22:39:07,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:39:07,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:39:07,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:39:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:39:07,804 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:39:07,804 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-20 22:39:07,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-20 22:39:07,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:39:07,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-20 22:39:07,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:39:07 BoogieIcfgContainer [2024-11-20 22:39:07,811 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:39:07,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:39:07,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:39:07,812 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:39:07,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:52" (3/4) ... [2024-11-20 22:39:07,814 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 22:39:07,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:39:07,816 INFO L158 Benchmark]: Toolchain (without parser) took 15473.41ms. Allocated memory was 222.3MB in the beginning and 369.1MB in the end (delta: 146.8MB). Free memory was 151.4MB in the beginning and 245.6MB in the end (delta: -94.1MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2024-11-20 22:39:07,816 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:39:07,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.45ms. Allocated memory is still 222.3MB. Free memory was 151.4MB in the beginning and 138.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 22:39:07,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.68ms. Allocated memory is still 222.3MB. Free memory was 138.8MB in the beginning and 137.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:39:07,817 INFO L158 Benchmark]: Boogie Preprocessor took 32.30ms. Allocated memory is still 222.3MB. Free memory was 136.8MB in the beginning and 135.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:39:07,817 INFO L158 Benchmark]: RCFGBuilder took 268.80ms. Allocated memory is still 222.3MB. Free memory was 135.3MB in the beginning and 120.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 22:39:07,817 INFO L158 Benchmark]: BuchiAutomizer took 14864.49ms. Allocated memory was 222.3MB in the beginning and 369.1MB in the end (delta: 146.8MB). Free memory was 120.8MB in the beginning and 246.6MB in the end (delta: -125.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-20 22:39:07,817 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 369.1MB. Free memory was 246.6MB in the beginning and 245.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:39:07,819 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.45ms. Allocated memory is still 222.3MB. Free memory was 151.4MB in the beginning and 138.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.68ms. Allocated memory is still 222.3MB. Free memory was 138.8MB in the beginning and 137.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.30ms. Allocated memory is still 222.3MB. Free memory was 136.8MB in the beginning and 135.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 268.80ms. Allocated memory is still 222.3MB. Free memory was 135.3MB in the beginning and 120.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 14864.49ms. Allocated memory was 222.3MB in the beginning and 369.1MB in the end (delta: 146.8MB). Free memory was 120.8MB in the beginning and 246.6MB in the end (delta: -125.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 369.1MB. Free memory was 246.6MB in the beginning and 245.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#v~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#v~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#v~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#v~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (8 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (((long long) 2 * i) + 1) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 7 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.8s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 12.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 475 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 265 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU3 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf100 lsp95 ukn65 mio100 lsp40 div325 bol100 ite100 ukn100 eq141 hnf95 smp50 dnf115 smp93 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 102ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-20 22:39:07,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:08,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:08,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:08,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:08,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-20 22:39:08,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE