./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 15:49:03,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:49:03,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:49:03,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:49:03,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:49:03,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:49:03,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:49:03,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:49:03,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:49:03,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:49:03,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:49:03,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:49:03,523 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:49:03,524 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:49:03,525 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:49:03,525 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:49:03,526 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:49:03,526 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:49:03,526 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:49:03,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:49:03,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:49:03,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:49:03,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:49:03,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:49:03,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:49:03,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:49:03,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:49:03,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:49:03,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:49:03,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:49:03,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:49:03,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:49:03,533 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:49:03,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:49:03,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:49:03,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:49:03,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:49:03,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:49:03,535 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:49:03,536 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-09 15:49:03,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:49:03,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:49:03,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:49:03,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:49:03,844 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:49:03,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-09 15:49:05,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:49:05,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:49:05,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-09 15:49:05,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d686c6031/2032f5ad529e4a38b39add39cba8e4e3/FLAG8336823c7 [2024-11-09 15:49:05,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d686c6031/2032f5ad529e4a38b39add39cba8e4e3 [2024-11-09 15:49:05,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:49:05,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:49:05,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:49:05,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:49:05,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:49:05,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a158d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05, skipping insertion in model container [2024-11-09 15:49:05,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:49:05,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:49:05,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:49:05,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:49:05,801 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:49:05,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05 WrapperNode [2024-11-09 15:49:05,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:49:05,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:49:05,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:49:05,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:49:05,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,835 INFO L138 Inliner]: procedures = 15, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2024-11-09 15:49:05,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:49:05,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:49:05,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:49:05,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:49:05,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,873 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-09 15:49:05,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:49:05,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:49:05,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:49:05,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:49:05,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (1/1) ... [2024-11-09 15:49:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:05,924 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-09 15:49:05,926 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-09 15:49:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:49:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:49:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 15:49:05,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:49:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:49:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:49:05,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:49:05,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:49:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:49:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:49:05,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:49:06,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:49:06,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:49:06,190 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-09 15:49:06,190 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:49:06,207 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:49:06,207 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 15:49:06,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:06 BoogieIcfgContainer [2024-11-09 15:49:06,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:49:06,209 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:49:06,209 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:49:06,214 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:49:06,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:49:06,215 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:49:05" (1/3) ... [2024-11-09 15:49:06,216 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce9b084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:49:06, skipping insertion in model container [2024-11-09 15:49:06,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:49:06,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:49:05" (2/3) ... [2024-11-09 15:49:06,217 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ce9b084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:49:06, skipping insertion in model container [2024-11-09 15:49:06,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:49:06,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:06" (3/3) ... [2024-11-09 15:49:06,219 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1-2.c [2024-11-09 15:49:06,267 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:49:06,267 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:49:06,267 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:49:06,267 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:49:06,267 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:49:06,268 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:49:06,268 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:49:06,268 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:49:06,271 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-09 15:49:06,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-09 15:49:06,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:06,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:06,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:49:06,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:49:06,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:49:06,290 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-09 15:49:06,292 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-09 15:49:06,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:06,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:06,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:49:06,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:49:06,304 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-09 15:49:06,305 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-09 15:49:06,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 15:49:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:06,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909238546] [2024-11-09 15:49:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:06,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:06,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:06,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-09 15:49:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:06,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560241783] [2024-11-09 15:49:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:06,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:06,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-09 15:49:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868330243] [2024-11-09 15:49:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:06,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:06,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:07,006 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:07,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:07,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:07,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:07,007 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:07,007 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,007 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:07,007 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:07,008 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration1_Lasso [2024-11-09 15:49:07,008 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:07,008 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:07,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:07,763 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:07,767 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:07,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:07,772 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-09 15:49:07,773 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-09 15:49:07,779 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-09 15:49:07,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:07,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:07,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:07,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:07,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:07,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:07,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:07,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:07,806 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-09 15:49:07,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:07,809 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-09 15:49:07,810 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-09 15:49:07,811 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-09 15:49:07,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:07,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:07,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:07,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:07,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:07,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:07,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:07,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:07,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:07,851 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-09 15:49:07,852 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-09 15:49:07,853 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-09 15:49:07,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:07,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:07,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:07,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:07,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:07,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:07,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:07,885 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-09 15:49:07,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:07,887 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-09 15:49:07,888 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-09 15:49:07,890 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-09 15:49:07,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:07,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:07,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:07,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:07,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:07,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:07,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:07,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:07,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:49:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:07,925 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-09 15:49:07,932 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-09 15:49:07,933 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-09 15:49:07,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:07,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:07,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:07,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:07,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:07,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:07,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:07,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:07,965 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-09 15:49:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:07,967 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-09 15:49:07,969 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-09 15:49:07,971 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-09 15:49:07,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:07,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:07,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:07,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:07,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:07,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:07,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:07,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:08,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-09 15:49:08,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:08,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:08,008 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-09 15:49:08,010 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-09 15:49:08,011 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-09 15:49:08,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:08,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:08,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:08,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:08,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:08,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:08,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:08,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:08,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:08,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:08,044 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-09 15:49:08,045 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-09 15:49:08,046 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-09 15:49:08,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:08,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:08,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:08,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:08,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:08,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:08,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:08,079 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-09 15:49:08,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:08,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:08,082 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-09 15:49:08,082 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-09 15:49:08,083 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-09 15:49:08,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:08,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:08,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:08,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:08,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:08,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:08,125 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:08,156 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:49:08,156 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-09 15:49:08,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:08,184 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-09 15:49:08,186 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-09 15:49:08,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:08,201 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:49:08,201 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:08,202 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-09 15:49:08,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:08,240 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:49:08,251 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:49:08,252 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:49:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:08,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:49:08,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:08,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:49:08,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:08,352 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-09 15:49:08,387 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-09 15:49:08,391 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-09 15:49:08,490 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-09 15:49:08,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:49:08,500 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-09 15:49:08,509 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-09 15:49:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-09 15:49:08,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-09 15:49:08,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:08,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:49:08,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:08,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:49:08,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:08,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2024-11-09 15:49:08,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-09 15:49:08,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 22 states and 31 transitions. [2024-11-09 15:49:08,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:49:08,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:49:08,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-11-09 15:49:08,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:08,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-09 15:49:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-11-09 15:49:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 15:49:08,607 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-09 15:49:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2024-11-09 15:49:08,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-09 15:49:08,609 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-09 15:49:08,609 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:49:08,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2024-11-09 15:49:08,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-09 15:49:08,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:08,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:08,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:49:08,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:49:08,611 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-09 15:49:08,611 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-09 15:49:08,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2024-11-09 15:49:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072410138] [2024-11-09 15:49:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:08,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:08,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1841148, now seen corresponding path program 1 times [2024-11-09 15:49:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426460215] [2024-11-09 15:49:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:08,700 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-09 15:49:08,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426460215] [2024-11-09 15:49:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426460215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:49:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:49:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:49:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692996916] [2024-11-09 15:49:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:49:08,708 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:49:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:49:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:49:08,712 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-09 15:49:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:08,724 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-11-09 15:49:08,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-11-09 15:49:08,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:08,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-11-09 15:49:08,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:49:08,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:49:08,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-09 15:49:08,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:08,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:49:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-09 15:49:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 15:49:08,730 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-09 15:49:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-09 15:49:08,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:49:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:49:08,731 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:49:08,731 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:49:08,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-09 15:49:08,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:08,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:08,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:08,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:49:08,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:08,733 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-09 15:49:08,733 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-09 15:49:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 2 times [2024-11-09 15:49:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216087551] [2024-11-09 15:49:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:08,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:08,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 1 times [2024-11-09 15:49:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171540950] [2024-11-09 15:49:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:08,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:08,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -823994471, now seen corresponding path program 1 times [2024-11-09 15:49:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766589576] [2024-11-09 15:49:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:08,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:09,001 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-09 15:49:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766589576] [2024-11-09 15:49:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766589576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:49:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:49:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:49:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648387496] [2024-11-09 15:49:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:49:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:49:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:49:09,130 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-09 15:49:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:09,167 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-09 15:49:09,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2024-11-09 15:49:09,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:09,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 26 transitions. [2024-11-09 15:49:09,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:49:09,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:49:09,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-11-09 15:49:09,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:09,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 15:49:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-11-09 15:49:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 15:49:09,170 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-09 15:49:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-09 15:49:09,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 15:49:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:49:09,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 15:49:09,173 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:49:09,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-09 15:49:09,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:09,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:09,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:09,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:09,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:09,175 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-09 15:49:09,175 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-09 15:49:09,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2024-11-09 15:49:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105481775] [2024-11-09 15:49:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:09,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:09,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:09,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 2 times [2024-11-09 15:49:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508999210] [2024-11-09 15:49:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:09,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:09,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:09,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -48611717, now seen corresponding path program 1 times [2024-11-09 15:49:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:09,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086136951] [2024-11-09 15:49:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:09,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:09,410 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-09 15:49:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086136951] [2024-11-09 15:49:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086136951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:49:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67141338] [2024-11-09 15:49:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:09,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:49:09,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:09,413 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-09 15:49:09,414 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-09 15:49:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:09,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:49:09,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:09,537 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-09 15:49:09,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:49:09,700 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-09 15:49:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67141338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:49:09,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:49:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-09 15:49:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786526297] [2024-11-09 15:49:09,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:49:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 15:49:09,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 15:49:09,841 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-09 15:49:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:09,939 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-11-09 15:49:09,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2024-11-09 15:49:09,940 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-11-09 15:49:09,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2024-11-09 15:49:09,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-09 15:49:09,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-09 15:49:09,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2024-11-09 15:49:09,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:09,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-09 15:49:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2024-11-09 15:49:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-11-09 15:49:09,948 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-09 15:49:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-09 15:49:09,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-09 15:49:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:49:09,950 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-09 15:49:09,950 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:49:09,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-11-09 15:49:09,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:09,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:09,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:09,953 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:09,953 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:49:09,953 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-09 15:49:09,954 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-09 15:49:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243825, now seen corresponding path program 1 times [2024-11-09 15:49:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879693186] [2024-11-09 15:49:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:09,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:09,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 1 times [2024-11-09 15:49:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911246624] [2024-11-09 15:49:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:10,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash -78992900, now seen corresponding path program 1 times [2024-11-09 15:49:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:10,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223869059] [2024-11-09 15:49:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:10,179 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-09 15:49:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223869059] [2024-11-09 15:49:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223869059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:49:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104743491] [2024-11-09 15:49:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:10,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:49:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:10,182 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-09 15:49:10,184 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-09 15:49:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:10,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:49:10,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:10,262 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-09 15:49:10,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:49:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104743491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:49:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:49:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-09 15:49:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435654976] [2024-11-09 15:49:10,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:49:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:49:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:49:10,346 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-09 15:49:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:10,374 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-09 15:49:10,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2024-11-09 15:49:10,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-09 15:49:10,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 38 transitions. [2024-11-09 15:49:10,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-09 15:49:10,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-09 15:49:10,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-09 15:49:10,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:10,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 15:49:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-09 15:49:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-11-09 15:49:10,378 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-09 15:49:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-09 15:49:10,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 15:49:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:49:10,379 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 15:49:10,380 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:49:10,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-09 15:49:10,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:10,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:10,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:10,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:10,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:49:10,381 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-09 15:49:10,381 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-09 15:49:10,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -873401203, now seen corresponding path program 1 times [2024-11-09 15:49:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:10,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111208633] [2024-11-09 15:49:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash 61175917, now seen corresponding path program 1 times [2024-11-09 15:49:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123391250] [2024-11-09 15:49:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2064874337, now seen corresponding path program 1 times [2024-11-09 15:49:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307718123] [2024-11-09 15:49:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:10,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:10,943 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:10,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:10,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:10,944 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:10,944 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:10,944 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:10,944 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:10,944 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:10,944 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration6_Lasso [2024-11-09 15:49:10,944 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:10,944 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:10,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:11,609 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:11,613 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:11,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,615 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-09 15:49:11,617 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-09 15:49:11,618 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-09 15:49:11,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,650 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-09 15:49:11,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,652 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-09 15:49:11,653 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-09 15:49:11,655 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-09 15:49:11,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,690 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-09 15:49:11,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,692 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-09 15:49:11,694 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-09 15:49:11,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-09 15:49:11,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,728 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-09 15:49:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,731 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-09 15:49:11,732 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-09 15:49:11,735 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-09 15:49:11,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,776 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-09 15:49:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,780 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-09 15:49:11,782 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-09 15:49:11,783 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-09 15:49:11,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,816 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-09 15:49:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,818 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-09 15:49:11,823 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-09 15:49:11,823 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-09 15:49:11,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,859 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-09 15:49:11,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,861 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-09 15:49:11,863 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-09 15:49:11,864 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-09 15:49:11,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:49:11,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,904 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-09 15:49:11,906 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-09 15:49:11,908 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-09 15:49:11,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:11,942 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-09 15:49:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,944 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-09 15:49:11,945 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-09 15:49:11,946 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-09 15:49:11,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:11,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:11,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:11,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:11,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:11,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:11,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:11,975 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:49:11,975 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-09 15:49:11,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:11,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:11,977 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-09 15:49:11,978 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-09 15:49:11,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:11,994 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:49:11,994 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:11,994 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-09 15:49:12,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:49:12,025 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:49:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:12,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:12,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:12,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:49:12,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:12,133 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-09 15:49:12,134 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-09 15:49:12,134 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-09 15:49:12,183 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-09 15:49:12,184 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-09 15:49:12,185 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-09 15:49:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-09 15:49:12,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-09 15:49:12,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:12,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2024-11-09 15:49:12,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:12,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2024-11-09 15:49:12,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:12,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2024-11-09 15:49:12,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:12,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 45 transitions. [2024-11-09 15:49:12,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:49:12,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:49:12,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2024-11-09 15:49:12,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:12,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-09 15:49:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2024-11-09 15:49:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-09 15:49:12,192 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-09 15:49:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-09 15:49:12,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-09 15:49:12,193 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-09 15:49:12,193 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:49:12,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2024-11-09 15:49:12,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:12,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:12,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:12,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:12,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:12,194 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-09 15:49:12,194 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-09 15:49:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -583325479, now seen corresponding path program 1 times [2024-11-09 15:49:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592184204] [2024-11-09 15:49:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:12,248 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-09 15:49:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592184204] [2024-11-09 15:49:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592184204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:49:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:49:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:49:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640422380] [2024-11-09 15:49:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:49:12,249 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:49:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 3 times [2024-11-09 15:49:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:12,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828678142] [2024-11-09 15:49:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:12,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:12,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:12,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:49:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:49:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:49:12,451 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-09 15:49:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:12,504 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-09 15:49:12,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2024-11-09 15:49:12,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:49:12,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2024-11-09 15:49:12,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-09 15:49:12,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-09 15:49:12,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-11-09 15:49:12,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:12,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-09 15:49:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-11-09 15:49:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-09 15:49:12,507 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-09 15:49:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-09 15:49:12,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-09 15:49:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:49:12,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-09 15:49:12,511 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:49:12,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2024-11-09 15:49:12,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:12,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:12,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:12,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:12,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:12,512 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-09 15:49:12,512 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-09 15:49:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -583325541, now seen corresponding path program 1 times [2024-11-09 15:49:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:12,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255239048] [2024-11-09 15:49:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:12,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:12,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:12,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 4 times [2024-11-09 15:49:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:12,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739865604] [2024-11-09 15:49:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:12,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:12,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:12,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 678523240, now seen corresponding path program 2 times [2024-11-09 15:49:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52491168] [2024-11-09 15:49:12,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:12,699 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-09 15:49:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52491168] [2024-11-09 15:49:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52491168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:49:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617771639] [2024-11-09 15:49:12,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:49:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:49:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:12,701 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-09 15:49:12,703 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-09 15:49:12,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:49:12,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:49:12,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:49:12,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:12,829 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-09 15:49:12,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:49:12,956 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-09 15:49:12,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617771639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:49:12,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:49:12,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 15:49:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768572266] [2024-11-09 15:49:12,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:49:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:13,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:49:13,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:49:13,107 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-09 15:49:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:13,222 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-11-09 15:49:13,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2024-11-09 15:49:13,223 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-11-09 15:49:13,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 86 transitions. [2024-11-09 15:49:13,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-09 15:49:13,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-09 15:49:13,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2024-11-09 15:49:13,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:13,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-09 15:49:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2024-11-09 15:49:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2024-11-09 15:49:13,232 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-09 15:49:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-11-09 15:49:13,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-09 15:49:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:49:13,233 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-09 15:49:13,233 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:49:13,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2024-11-09 15:49:13,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-09 15:49:13,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:13,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:13,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:13,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:13,235 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-09 15:49:13,235 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-09 15:49:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1530158845, now seen corresponding path program 2 times [2024-11-09 15:49:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:13,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914883543] [2024-11-09 15:49:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:13,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:13,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:13,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:13,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 5 times [2024-11-09 15:49:13,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:13,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145868360] [2024-11-09 15:49:13,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:13,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:13,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1481430602, now seen corresponding path program 3 times [2024-11-09 15:49:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103460542] [2024-11-09 15:49:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:13,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:13,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:13,981 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:13,981 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:13,981 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:13,981 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:13,981 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:13,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:13,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:13,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:13,982 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration9_Lasso [2024-11-09 15:49:13,982 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:13,982 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:13,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:13,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:13,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:13,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:14,899 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:14,900 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:14,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:14,903 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-09 15:49:14,906 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-09 15:49:14,907 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-09 15:49:14,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:14,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:14,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:14,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:14,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:14,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:14,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:14,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-09 15:49:14,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:14,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:14,940 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-09 15:49:14,941 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-09 15:49:14,941 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-09 15:49:14,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:14,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:14,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:14,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:14,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:14,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:14,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:14,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:49:14,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:14,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:14,973 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-09 15:49:14,974 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-09 15:49:14,975 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-09 15:49:14,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:14,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:14,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:14,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:14,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:14,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:14,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:14,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:14,999 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-09 15:49:14,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,000 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-09 15:49:15,001 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-09 15:49:15,002 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-09 15:49:15,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,026 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-09 15:49:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,028 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-09 15:49:15,030 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-09 15:49:15,031 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-09 15:49:15,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:15,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,055 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-09 15:49:15,056 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-09 15:49:15,057 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-09 15:49:15,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,078 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-09 15:49:15,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,080 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-09 15:49:15,081 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-09 15:49:15,082 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-09 15:49:15,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:49:15,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,112 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-09 15:49:15,113 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-09 15:49:15,114 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-09 15:49:15,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-09 15:49:15,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,148 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-09 15:49:15,149 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-09 15:49:15,150 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-09 15:49:15,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,173 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-09 15:49:15,174 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-09 15:49:15,174 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-09 15:49:15,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 15:49:15,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,197 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-09 15:49:15,198 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-09 15:49:15,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-09 15:49:15,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,229 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-09 15:49:15,230 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-09 15:49:15,231 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-09 15:49:15,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:15,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,257 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-09 15:49:15,258 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-09 15:49:15,259 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-09 15:49:15,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,285 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-09 15:49:15,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,287 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-09 15:49:15,287 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-09 15:49:15,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-09 15:49:15,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-09 15:49:15,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,314 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-09 15:49:15,315 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-09 15:49:15,316 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-09 15:49:15,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,344 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-09 15:49:15,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,345 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-09 15:49:15,346 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-09 15:49:15,347 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-09 15:49:15,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,370 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-09 15:49:15,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,372 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-09 15:49:15,373 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-09 15:49:15,373 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-09 15:49:15,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:15,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:15,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:15,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:15,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-09 15:49:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,397 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-09 15:49:15,398 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-09 15:49:15,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:49:15,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:15,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:15,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:15,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:15,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:15,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:15,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:15,442 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:49:15,443 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-09 15:49:15,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:15,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:15,444 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-09 15:49:15,445 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-09 15:49:15,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:15,456 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:49:15,456 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:15,456 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-09 15:49:15,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-09 15:49:15,486 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-09 15:49:15,488 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-09 15:49:15,488 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:49:15,489 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:49:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:15,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:15,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:15,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 15:49:15,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:15,626 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-09 15:49:15,626 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-09 15:49:15,626 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-09 15:49:15,734 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-09 15:49:15,734 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-09 15:49:15,735 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-09 15:49:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2024-11-09 15:49:15,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-09 15:49:15,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:15,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 21 letters. Loop has 6 letters. [2024-11-09 15:49:15,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:15,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 12 letters. [2024-11-09 15:49:15,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:15,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 126 transitions. [2024-11-09 15:49:15,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-09 15:49:15,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 92 states and 124 transitions. [2024-11-09 15:49:15,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-09 15:49:15,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-09 15:49:15,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 124 transitions. [2024-11-09 15:49:15,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:15,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-11-09 15:49:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 124 transitions. [2024-11-09 15:49:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2024-11-09 15:49:15,743 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-09 15:49:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-11-09 15:49:15,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-09 15:49:15,744 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-09 15:49:15,744 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:49:15,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 90 transitions. [2024-11-09 15:49:15,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-09 15:49:15,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:15,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:15,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:15,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:49:15,745 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-09 15:49:15,745 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-09 15:49:15,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash 67745056, now seen corresponding path program 1 times [2024-11-09 15:49:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:15,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709442404] [2024-11-09 15:49:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:15,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:15,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 2 times [2024-11-09 15:49:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664453612] [2024-11-09 15:49:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:15,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:15,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:15,803 INFO L85 PathProgramCache]: Analyzing trace with hash -804574741, now seen corresponding path program 1 times [2024-11-09 15:49:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611499674] [2024-11-09 15:49:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:15,812 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-09 15:49:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:15,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:15,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:17,251 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:17,251 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:17,251 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:17,251 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:17,251 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:17,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:17,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:17,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:17,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration10_Lasso [2024-11-09 15:49:17,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:17,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:17,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:17,862 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:17,862 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:17,864 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-09 15:49:17,865 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-09 15:49:17,866 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-09 15:49:17,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:17,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:17,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:17,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:17,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:17,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:17,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:17,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:17,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-09 15:49:17,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:17,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:17,888 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-09 15:49:17,889 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-09 15:49:17,890 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-09 15:49:17,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:17,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:17,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:17,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:17,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:17,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:17,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:17,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:17,911 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-09 15:49:17,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:17,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:17,912 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-09 15:49:17,913 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-09 15:49:17,914 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-09 15:49:17,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:17,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:17,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:17,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:17,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:17,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:17,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:17,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:17,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:17,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:17,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:17,944 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-09 15:49:17,945 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-09 15:49:17,946 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-09 15:49:17,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:17,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:17,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:17,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:17,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:17,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:17,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:17,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:17,976 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-09 15:49:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:17,978 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-09 15:49:17,979 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-09 15:49:17,980 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-09 15:49:17,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:17,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:17,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:17,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:17,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:17,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:18,008 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:18,023 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:49:18,023 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-09 15:49:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:18,024 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-09 15:49:18,025 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-09 15:49:18,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:18,036 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:49:18,036 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:18,036 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-09 15:49:18,047 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-09 15:49:18,057 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-09 15:49:18,059 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-09 15:49:18,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:49:18,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:49:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:18,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:18,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:18,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:18,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:18,142 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-09 15:49:18,142 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-09 15:49:18,142 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-09 15:49:18,160 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-09 15:49:18,161 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-09 15:49:18,161 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-09 15:49:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-11-09 15:49:18,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-09 15:49:18,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-09 15:49:18,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 8 letters. [2024-11-09 15:49:18,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:18,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2024-11-09 15:49:18,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:49:18,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 46 states and 61 transitions. [2024-11-09 15:49:18,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-09 15:49:18,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-09 15:49:18,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 61 transitions. [2024-11-09 15:49:18,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:18,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-09 15:49:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 61 transitions. [2024-11-09 15:49:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 15:49:18,165 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-09 15:49:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-11-09 15:49:18,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-09 15:49:18,166 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-09 15:49:18,166 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:49:18,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2024-11-09 15:49:18,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-09 15:49:18,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:18,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:18,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:18,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-09 15:49:18,167 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-09 15:49:18,167 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-09 15:49:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash -606279004, now seen corresponding path program 4 times [2024-11-09 15:49:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332717102] [2024-11-09 15:49:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:18,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:18,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 64187797, now seen corresponding path program 2 times [2024-11-09 15:49:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319322506] [2024-11-09 15:49:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:18,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:18,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:18,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1784762158, now seen corresponding path program 1 times [2024-11-09 15:49:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813310873] [2024-11-09 15:49:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:18,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:18,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:19,033 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:19,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:19,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:19,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:19,034 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:19,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:19,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:19,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration11_Lasso [2024-11-09 15:49:19,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:19,034 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:19,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:19,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:19,670 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:19,670 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,672 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-09 15:49:19,675 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-09 15:49:19,676 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-09 15:49:19,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:19,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:19,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,712 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-09 15:49:19,713 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-09 15:49:19,714 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-09 15:49:19,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:19,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:19,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,740 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-09 15:49:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,742 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-09 15:49:19,743 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-09 15:49:19,743 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-09 15:49:19,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:19,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:19,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:19,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-09 15:49:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,768 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-09 15:49:19,769 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-09 15:49:19,770 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-09 15:49:19,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:19,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:19,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:19,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-09 15:49:19,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,795 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-09 15:49:19,796 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-09 15:49:19,797 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-09 15:49:19,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:19,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:19,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:19,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,819 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-09 15:49:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,821 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-09 15:49:19,822 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-09 15:49:19,822 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-09 15:49:19,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:19,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:19,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,845 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-09 15:49:19,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,847 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-09 15:49:19,848 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-09 15:49:19,848 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-09 15:49:19,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:19,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:19,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:19,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,869 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-09 15:49:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,871 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-09 15:49:19,872 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-09 15:49:19,872 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-09 15:49:19,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:19,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:19,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-09 15:49:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,899 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-09 15:49:19,899 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-09 15:49:19,900 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-09 15:49:19,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:19,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:19,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:19,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:19,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-09 15:49:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:19,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:19,926 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-09 15:49:19,927 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-09 15:49:19,928 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-09 15:49:19,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:19,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:19,939 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:49:19,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:19,948 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:49:19,948 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:49:19,970 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:20,017 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-11-09 15:49:20,017 INFO L444 ModelExtractionUtils]: 12 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-09 15:49:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:20,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:20,019 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-09 15:49:20,019 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-09 15:49:20,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:20,031 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-09 15:49:20,031 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:20,031 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-09 15:49:20,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-09 15:49:20,049 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-09 15:49:20,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-09 15:49:20,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:20,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:20,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:20,154 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-09 15:49:20,155 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-09 15:49:20,155 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-09 15:49:20,183 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-09 15:49:20,184 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-09 15:49:20,184 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-09 15:49:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-09 15:49:20,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-09 15:49:20,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:20,185 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:49:20,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:20,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:20,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:20,278 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-09 15:49:20,279 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-09 15:49:20,279 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-09 15:49:20,316 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-09 15:49:20,319 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-09 15:49:20,319 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-09 15:49:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2024-11-09 15:49:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-09 15:49:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:20,320 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:49:20,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:20,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:20,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:20,422 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-09 15:49:20,423 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-09 15:49:20,423 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-09 15:49:20,459 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-09 15:49:20,468 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-09 15:49:20,468 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-09 15:49:20,469 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-09 15:49:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2024-11-09 15:49:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-09 15:49:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 24 letters. Loop has 5 letters. [2024-11-09 15:49:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 10 letters. [2024-11-09 15:49:20,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:20,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 175 transitions. [2024-11-09 15:49:20,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2024-11-09 15:49:20,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 101 states and 139 transitions. [2024-11-09 15:49:20,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-09 15:49:20,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-09 15:49:20,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 139 transitions. [2024-11-09 15:49:20,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:20,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 139 transitions. [2024-11-09 15:49:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 139 transitions. [2024-11-09 15:49:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2024-11-09 15:49:20,478 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-09 15:49:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-09 15:49:20,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-09 15:49:20,478 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-09 15:49:20,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:49:20,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 121 transitions. [2024-11-09 15:49:20,479 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-09 15:49:20,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:20,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:20,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:20,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:20,480 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-09 15:49:20,480 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-09 15:49:20,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash -604616314, now seen corresponding path program 1 times [2024-11-09 15:49:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:20,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072165075] [2024-11-09 15:49:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:20,517 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-09 15:49:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072165075] [2024-11-09 15:49:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072165075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:49:20,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:49:20,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:49:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802310194] [2024-11-09 15:49:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:49:20,518 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:49:20,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 6 times [2024-11-09 15:49:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172461769] [2024-11-09 15:49:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:49:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:49:20,709 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-09 15:49:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:20,738 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2024-11-09 15:49:20,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 117 transitions. [2024-11-09 15:49:20,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-09 15:49:20,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 84 states and 114 transitions. [2024-11-09 15:49:20,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-09 15:49:20,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-09 15:49:20,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 114 transitions. [2024-11-09 15:49:20,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:20,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 114 transitions. [2024-11-09 15:49:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 114 transitions. [2024-11-09 15:49:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-09 15:49:20,743 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-09 15:49:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-09 15:49:20,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-09 15:49:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:49:20,744 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-09 15:49:20,744 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:49:20,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 108 transitions. [2024-11-09 15:49:20,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-09 15:49:20,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:20,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:20,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:20,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:20,747 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-09 15:49:20,747 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-09 15:49:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -604675896, now seen corresponding path program 1 times [2024-11-09 15:49:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641807865] [2024-11-09 15:49:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:20,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 7 times [2024-11-09 15:49:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:20,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430499466] [2024-11-09 15:49:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:20,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1188823131, now seen corresponding path program 1 times [2024-11-09 15:49:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576586205] [2024-11-09 15:49:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:20,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:20,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:21,524 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:49:21,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:49:21,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:49:21,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:49:21,524 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:49:21,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:21,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:49:21,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:49:21,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration13_Lasso [2024-11-09 15:49:21,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:49:21,524 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:49:21,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:21,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:49:22,208 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:49:22,209 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:49:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,211 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-09 15:49:22,213 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-09 15:49:22,214 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-09 15:49:22,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:22,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:22,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:22,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:22,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,237 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-09 15:49:22,237 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-09 15:49:22,238 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-09 15:49:22,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:22,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:22,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:22,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,260 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-09 15:49:22,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,262 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-09 15:49:22,263 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-09 15:49:22,264 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-09 15:49:22,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:22,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:22,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:22,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-09 15:49:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,287 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-09 15:49:22,288 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-09 15:49:22,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-09 15:49:22,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:22,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:22,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-09 15:49:22,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,313 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-09 15:49:22,314 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-09 15:49:22,314 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-09 15:49:22,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:22,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:22,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,339 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-09 15:49:22,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,340 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-09 15:49:22,341 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-09 15:49:22,342 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-09 15:49:22,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:49:22,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:49:22,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:49:22,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,364 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-09 15:49:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,366 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-09 15:49:22,367 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-09 15:49:22,367 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-09 15:49:22,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,378 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:49:22,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,387 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:49:22,387 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:49:22,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-09 15:49:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,415 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-09 15:49:22,416 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-09 15:49:22,416 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-09 15:49:22,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:22,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:22,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:49:22,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-09 15:49:22,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,441 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-09 15:49:22,442 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-09 15:49:22,442 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-09 15:49:22,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:49:22,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:49:22,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:49:22,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:49:22,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:49:22,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:49:22,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:49:22,478 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 15:49:22,479 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:49:22,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:49:22,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,480 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-09 15:49:22,481 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-09 15:49:22,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:49:22,492 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:49:22,492 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:49:22,492 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-09 15:49:22,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-09 15:49:22,515 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-09 15:49:22,516 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-09 15:49:22,517 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:49:22,517 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:49:22,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:22,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:49:22,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:22,581 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-09 15:49:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:22,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:49:22,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:22,635 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-09 15:49:22,635 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-09 15:49:22,635 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-09 15:49:22,663 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-09 15:49:22,663 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-09 15:49:22,664 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-09 15:49:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-09 15:49:22,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 6 letters. [2024-11-09 15:49:22,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:22,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 25 letters. Loop has 6 letters. [2024-11-09 15:49:22,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:22,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 12 letters. [2024-11-09 15:49:22,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:49:22,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 307 transitions. [2024-11-09 15:49:22,667 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2024-11-09 15:49:22,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 150 states and 219 transitions. [2024-11-09 15:49:22,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-09 15:49:22,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-09 15:49:22,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 219 transitions. [2024-11-09 15:49:22,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:49:22,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-11-09 15:49:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 219 transitions. [2024-11-09 15:49:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 110. [2024-11-09 15:49:22,674 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-09 15:49:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-09 15:49:22,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-09 15:49:22,675 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-09 15:49:22,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:49:22,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 161 transitions. [2024-11-09 15:49:22,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-09 15:49:22,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:49:22,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:49:22,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:49:22,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:49:22,680 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-09 15:49:22,681 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-09 15:49:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash -604675898, now seen corresponding path program 2 times [2024-11-09 15:49:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216831677] [2024-11-09 15:49:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:49:22,769 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-09 15:49:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:49:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216831677] [2024-11-09 15:49:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216831677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:49:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645658409] [2024-11-09 15:49:22,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:49:22,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:49:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:49:22,772 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-09 15:49:22,774 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-09 15:49:22,845 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:49:22,846 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:49:22,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:49:22,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:49:22,864 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-09 15:49:22,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:49:22,885 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-09 15:49:22,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645658409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:49:22,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:49:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-09 15:49:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010797003] [2024-11-09 15:49:22,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:49:22,886 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:49:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:49:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 8 times [2024-11-09 15:49:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:49:22,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858109986] [2024-11-09 15:49:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:49:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:49:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:22,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:49:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:49:22,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:49:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:49:23,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:49:23,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:49:23,062 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-09 15:49:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:49:23,114 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-11-09 15:49:23,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 87 transitions. [2024-11-09 15:49:23,115 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:49:23,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2024-11-09 15:49:23,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:49:23,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:49:23,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:49:23,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:49:23,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:49:23,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:49:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:49:23,116 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:49:23,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:49:23,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:49:23,117 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:49:23,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:49:23,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:49:23 BoogieIcfgContainer [2024-11-09 15:49:23,123 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:49:23,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:49:23,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:49:23,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:49:23,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:49:06" (3/4) ... [2024-11-09 15:49:23,126 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:49:23,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:49:23,127 INFO L158 Benchmark]: Toolchain (without parser) took 17612.17ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 104.8MB in the beginning and 185.3MB in the end (delta: -80.5MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-11-09 15:49:23,127 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:49:23,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.38ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 91.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:49:23,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.60ms. Allocated memory is still 159.4MB. Free memory was 91.8MB in the beginning and 90.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:49:23,127 INFO L158 Benchmark]: Boogie Preprocessor took 50.17ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 88.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:49:23,127 INFO L158 Benchmark]: RCFGBuilder took 319.52ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 74.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 15:49:23,128 INFO L158 Benchmark]: BuchiAutomizer took 16914.35ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 74.2MB in the beginning and 185.3MB in the end (delta: -111.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-11-09 15:49:23,128 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 297.8MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:49:23,129 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.22ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.38ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 91.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.60ms. Allocated memory is still 159.4MB. Free memory was 91.8MB in the beginning and 90.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.17ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 88.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.52ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 74.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 16914.35ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 74.2MB in the beginning and 185.3MB in the end (delta: -111.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 297.8MB. Free memory is still 185.3MB. 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 16.8s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 14.8s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 8. Automata minimization 0.1s 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: 105ms 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-09 15:49:23,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2024-11-09 15:49:23,349 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-09 15:49:23,550 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-09 15:49:23,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 15:49:23,951 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