./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:18:48,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:18:48,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:18:48,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:18:48,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:18:48,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:18:48,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:18:48,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:18:48,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:18:48,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:18:48,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:18:48,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:18:48,099 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:18:48,100 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:18:48,101 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:18:48,101 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:18:48,101 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:18:48,101 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:18:48,101 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:18:48,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:18:48,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:18:48,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:18:48,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:18:48,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:18:48,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:18:48,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:18:48,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:18:48,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:18:48,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:18:48,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:18:48,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:18:48,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:18:48,104 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:18:48,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:18:48,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:18:48,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:18:48,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:18:48,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:18:48,105 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:18:48,106 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-10-25 00:18:48,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:18:48,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:18:48,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:18:48,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:18:48,365 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:18:48,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-10-25 00:18:49,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:18:49,900 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:18:49,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-10-25 00:18:49,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee25c64f/69fc7bbf6b5a4a1bb0fc9740abf897a7/FLAG1bbac6b6b [2024-10-25 00:18:49,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee25c64f/69fc7bbf6b5a4a1bb0fc9740abf897a7 [2024-10-25 00:18:49,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:18:49,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:18:49,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:18:49,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:18:49,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:18:49,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:18:49" (1/1) ... [2024-10-25 00:18:49,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf34a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:49, skipping insertion in model container [2024-10-25 00:18:49,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:18:49" (1/1) ... [2024-10-25 00:18:49,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:18:50,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:18:50,104 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:18:50,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:18:50,137 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:18:50,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50 WrapperNode [2024-10-25 00:18:50,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:18:50,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:18:50,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:18:50,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:18:50,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,165 INFO L138 Inliner]: procedures = 15, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2024-10-25 00:18:50,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:18:50,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:18:50,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:18:50,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:18:50,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,187 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-10-25 00:18:50,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:18:50,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:18:50,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:18:50,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:18:50,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (1/1) ... [2024-10-25 00:18:50,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:50,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:50,233 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-10-25 00:18:50,236 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-10-25 00:18:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:18:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:18:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:18:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:18:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:18:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:18:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:18:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:18:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:18:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:18:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:18:50,334 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:18:50,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:18:50,475 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-25 00:18:50,475 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:18:50,489 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:18:50,489 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-25 00:18:50,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:50 BoogieIcfgContainer [2024-10-25 00:18:50,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:18:50,491 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:18:50,491 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:18:50,494 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:18:50,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:18:50,495 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:18:49" (1/3) ... [2024-10-25 00:18:50,495 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51bae3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:18:50, skipping insertion in model container [2024-10-25 00:18:50,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:18:50,496 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:50" (2/3) ... [2024-10-25 00:18:50,496 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51bae3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:18:50, skipping insertion in model container [2024-10-25 00:18:50,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:18:50,496 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:50" (3/3) ... [2024-10-25 00:18:50,497 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1-2.c [2024-10-25 00:18:50,538 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:18:50,539 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:18:50,539 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:18:50,539 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:18:50,539 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:18:50,539 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:18:50,539 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:18:50,539 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:18:50,542 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-10-25 00:18:50,555 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-25 00:18:50,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:50,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:50,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:18:50,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:50,559 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:18:50,559 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-10-25 00:18:50,560 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-25 00:18:50,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:50,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:50,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:18:50,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:50,566 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-10-25 00:18:50,566 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-10-25 00:18:50,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-25 00:18:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360600923] [2024-10-25 00:18:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:50,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-10-25 00:18:50,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72146537] [2024-10-25 00:18:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-10-25 00:18:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122948635] [2024-10-25 00:18:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:50,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:51,160 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:18:51,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:18:51,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:18:51,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:18:51,161 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:18:51,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:18:51,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:18:51,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration1_Lasso [2024-10-25 00:18:51,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:18:51,162 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:18:51,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:51,743 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:18:51,747 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:18:51,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,750 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-10-25 00:18:51,751 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-10-25 00:18:51,752 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-10-25 00:18:51,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:51,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:51,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:51,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:51,783 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-10-25 00:18:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,786 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-10-25 00:18:51,787 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-10-25 00:18:51,788 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-10-25 00:18:51,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:51,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:51,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:51,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-25 00:18:51,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,818 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-10-25 00:18:51,819 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-10-25 00:18:51,821 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-10-25 00:18:51,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:51,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:51,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:51,850 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-10-25 00:18:51,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,855 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-10-25 00:18:51,856 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-10-25 00:18:51,861 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-10-25 00:18:51,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:51,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:51,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:51,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:51,892 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-10-25 00:18:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,895 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-10-25 00:18:51,913 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-10-25 00:18:51,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-10-25 00:18:51,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:51,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:51,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:51,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:51,939 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-10-25 00:18:51,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,942 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-10-25 00:18:51,943 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-10-25 00:18:51,944 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-10-25 00:18:51,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:51,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:51,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:51,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:51,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:51,976 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-10-25 00:18:51,977 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-10-25 00:18:51,979 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-10-25 00:18:51,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:51,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:51,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:51,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:51,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:51,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:51,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:52,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-25 00:18:52,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:52,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:52,011 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-10-25 00:18:52,012 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-10-25 00:18:52,013 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-10-25 00:18:52,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:52,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:52,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:52,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:52,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:52,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:52,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:52,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:52,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:52,050 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-10-25 00:18:52,052 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-10-25 00:18:52,053 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-10-25 00:18:52,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:52,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:52,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:52,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:52,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:52,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:52,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:18:52,110 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-25 00:18:52,111 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-25 00:18:52,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:52,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:52,131 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-10-25 00:18:52,133 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-10-25 00:18:52,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:18:52,146 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-10-25 00:18:52,147 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:18:52,147 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-10-25 00:18:52,160 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-10-25 00:18:52,177 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-25 00:18:52,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:18:52,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:18:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:52,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 00:18:52,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:52,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-25 00:18:52,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:52,305 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-10-25 00:18:52,306 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-10-25 00:18:52,365 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-10-25 00:18:52,367 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-10-25 00:18:52,371 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-10-25 00:18:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-10-25 00:18:52,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2024-10-25 00:18:52,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:52,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-25 00:18:52,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:52,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-25 00:18:52,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:52,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2024-10-25 00:18:52,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-25 00:18:52,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 22 states and 31 transitions. [2024-10-25 00:18:52,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-25 00:18:52,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:18:52,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-10-25 00:18:52,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:52,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-10-25 00:18:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-10-25 00:18:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-25 00:18:52,399 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-10-25 00:18:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2024-10-25 00:18:52,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-10-25 00:18:52,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-10-25 00:18:52,400 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:18:52,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2024-10-25 00:18:52,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-10-25 00:18:52,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:52,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:52,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-25 00:18:52,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:52,402 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-10-25 00:18:52,402 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-10-25 00:18:52,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2024-10-25 00:18:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013630396] [2024-10-25 00:18:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:52,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1841148, now seen corresponding path program 1 times [2024-10-25 00:18:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734575633] [2024-10-25 00:18:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:52,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:52,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734575633] [2024-10-25 00:18:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734575633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 00:18:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000158547] [2024-10-25 00:18:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:52,457 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:18:52,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-25 00:18:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-25 00:18:52,460 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-10-25 00:18:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:52,464 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-10-25 00:18:52,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-10-25 00:18:52,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:52,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-10-25 00:18:52,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-25 00:18:52,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-25 00:18:52,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-10-25 00:18:52,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:52,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-25 00:18:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-10-25 00:18:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-25 00:18:52,467 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-10-25 00:18:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-25 00:18:52,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-25 00:18:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 00:18:52,468 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-25 00:18:52,469 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:18:52,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-10-25 00:18:52,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:52,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:52,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:52,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-25 00:18:52,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:18:52,470 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-10-25 00:18:52,470 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-10-25 00:18:52,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 2 times [2024-10-25 00:18:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692925096] [2024-10-25 00:18:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 1 times [2024-10-25 00:18:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172019995] [2024-10-25 00:18:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:52,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash -823994471, now seen corresponding path program 1 times [2024-10-25 00:18:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410106390] [2024-10-25 00:18:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:52,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410106390] [2024-10-25 00:18:52,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410106390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:52,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:52,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:18:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985206148] [2024-10-25 00:18:52,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:18:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:18:52,799 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-10-25 00:18:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:52,838 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-25 00:18:52,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2024-10-25 00:18:52,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:52,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 26 transitions. [2024-10-25 00:18:52,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-10-25 00:18:52,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-25 00:18:52,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-10-25 00:18:52,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:52,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-25 00:18:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-10-25 00:18:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-25 00:18:52,843 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-10-25 00:18:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-25 00:18:52,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-25 00:18:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:18:52,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-25 00:18:52,850 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:18:52,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-10-25 00:18:52,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:52,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:52,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:52,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:52,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:18:52,851 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-10-25 00:18:52,851 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-10-25 00:18:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2024-10-25 00:18:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624559814] [2024-10-25 00:18:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:52,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 2 times [2024-10-25 00:18:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700332752] [2024-10-25 00:18:52,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:52,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:52,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash -48611717, now seen corresponding path program 1 times [2024-10-25 00:18:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:52,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80602879] [2024-10-25 00:18:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:52,952 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-10-25 00:18:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:53,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:53,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80602879] [2024-10-25 00:18:53,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80602879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:53,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56079143] [2024-10-25 00:18:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:53,078 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-10-25 00:18:53,079 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-10-25 00:18:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:53,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-25 00:18:53,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:53,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56079143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:53,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-10-25 00:18:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836639016] [2024-10-25 00:18:53,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-25 00:18:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-25 00:18:53,438 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-10-25 00:18:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:53,514 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-25 00:18:53,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2024-10-25 00:18:53,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-10-25 00:18:53,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2024-10-25 00:18:53,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:18:53,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-25 00:18:53,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2024-10-25 00:18:53,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:53,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-25 00:18:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2024-10-25 00:18:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-10-25 00:18:53,519 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-10-25 00:18:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-25 00:18:53,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-25 00:18:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:18:53,521 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-25 00:18:53,521 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:18:53,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-10-25 00:18:53,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:53,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:53,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:53,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:53,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:53,522 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-10-25 00:18:53,522 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-10-25 00:18:53,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243825, now seen corresponding path program 1 times [2024-10-25 00:18:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260156325] [2024-10-25 00:18:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:53,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 1 times [2024-10-25 00:18:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317923957] [2024-10-25 00:18:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -78992900, now seen corresponding path program 1 times [2024-10-25 00:18:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780421588] [2024-10-25 00:18:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:53,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780421588] [2024-10-25 00:18:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780421588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165583803] [2024-10-25 00:18:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:53,681 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-10-25 00:18:53,682 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-10-25 00:18:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:53,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 00:18:53,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 00:18:53,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-25 00:18:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165583803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:53,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-25 00:18:53,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-10-25 00:18:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701896214] [2024-10-25 00:18:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:53,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:18:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-25 00:18:53,811 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-10-25 00:18:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:53,836 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-10-25 00:18:53,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2024-10-25 00:18:53,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-25 00:18:53,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 38 transitions. [2024-10-25 00:18:53,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-25 00:18:53,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-10-25 00:18:53,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-10-25 00:18:53,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:18:53,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-25 00:18:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-10-25 00:18:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-10-25 00:18:53,841 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-10-25 00:18:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-25 00:18:53,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-25 00:18:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:18:53,846 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-25 00:18:53,846 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:18:53,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-10-25 00:18:53,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:53,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:53,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:53,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:53,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:18:53,847 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-10-25 00:18:53,847 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-10-25 00:18:53,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash -873401203, now seen corresponding path program 1 times [2024-10-25 00:18:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:53,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448946935] [2024-10-25 00:18:53,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 61175917, now seen corresponding path program 1 times [2024-10-25 00:18:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939970494] [2024-10-25 00:18:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:53,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2064874337, now seen corresponding path program 1 times [2024-10-25 00:18:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988422832] [2024-10-25 00:18:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:53,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:54,279 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:18:54,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:18:54,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:18:54,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:18:54,280 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:18:54,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:54,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:18:54,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:18:54,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration6_Lasso [2024-10-25 00:18:54,280 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:18:54,281 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:18:54,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:54,823 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:18:54,823 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:18:54,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:54,829 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-10-25 00:18:54,830 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-10-25 00:18:54,831 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-10-25 00:18:54,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:54,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:54,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:54,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:54,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:54,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:54,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:54,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:54,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:54,862 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-10-25 00:18:54,863 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-10-25 00:18:54,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-10-25 00:18:54,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:54,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:54,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:54,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:54,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:54,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:54,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:54,891 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-10-25 00:18:54,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:54,898 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-10-25 00:18:54,903 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-10-25 00:18:54,903 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-10-25 00:18:54,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:54,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:54,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:54,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:54,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:54,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:54,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:54,930 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-10-25 00:18:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:54,933 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-10-25 00:18:54,936 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-10-25 00:18:54,937 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-10-25 00:18:54,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:54,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:54,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:54,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:54,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:54,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:54,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:54,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:54,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:54,980 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-10-25 00:18:54,981 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-10-25 00:18:54,982 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-10-25 00:18:54,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:54,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:54,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:54,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:54,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:54,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:54,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:55,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-25 00:18:55,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:55,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,015 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-10-25 00:18:55,016 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-10-25 00:18:55,018 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-10-25 00:18:55,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:55,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:55,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:55,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:55,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:55,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:55,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:55,044 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-10-25 00:18:55,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,046 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-10-25 00:18:55,047 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-10-25 00:18:55,048 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-10-25 00:18:55,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:55,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:55,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:55,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:55,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:55,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:55,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:55,079 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-10-25 00:18:55,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,081 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-10-25 00:18:55,082 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-10-25 00:18:55,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-10-25 00:18:55,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:55,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:55,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:55,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:55,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:55,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:55,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:55,110 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-10-25 00:18:55,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,112 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-10-25 00:18:55,113 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-10-25 00:18:55,113 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-10-25 00:18:55,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:55,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:55,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:55,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:55,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:55,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:55,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:18:55,138 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-25 00:18:55,138 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-25 00:18:55,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:55,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,140 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-10-25 00:18:55,141 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-10-25 00:18:55,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:18:55,155 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:18:55,155 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:18:55,155 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-10-25 00:18:55,167 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-10-25 00:18:55,180 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-25 00:18:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:55,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:18:55,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:55,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-25 00:18:55,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:55,276 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-10-25 00:18:55,276 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-10-25 00:18:55,318 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-10-25 00:18:55,320 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-10-25 00:18:55,320 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-10-25 00:18:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-10-25 00:18:55,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2024-10-25 00:18:55,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:55,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2024-10-25 00:18:55,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:55,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2024-10-25 00:18:55,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:55,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2024-10-25 00:18:55,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:55,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 45 transitions. [2024-10-25 00:18:55,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:18:55,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-25 00:18:55,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2024-10-25 00:18:55,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:55,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-10-25 00:18:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2024-10-25 00:18:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-25 00:18:55,326 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-10-25 00:18:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-10-25 00:18:55,327 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-25 00:18:55,328 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-25 00:18:55,328 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:18:55,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2024-10-25 00:18:55,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:55,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:55,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:55,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:55,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:18:55,332 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-10-25 00:18:55,332 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-10-25 00:18:55,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash -583325479, now seen corresponding path program 1 times [2024-10-25 00:18:55,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:55,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246802637] [2024-10-25 00:18:55,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:18:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246802637] [2024-10-25 00:18:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246802637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:18:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298469971] [2024-10-25 00:18:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:55,398 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:55,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 3 times [2024-10-25 00:18:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634257128] [2024-10-25 00:18:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:55,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:55,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:55,417 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-10-25 00:18:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:18:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:18:55,547 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-10-25 00:18:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:55,593 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-10-25 00:18:55,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2024-10-25 00:18:55,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-25 00:18:55,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2024-10-25 00:18:55,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-25 00:18:55,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:18:55,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-10-25 00:18:55,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:55,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-10-25 00:18:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-10-25 00:18:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-10-25 00:18:55,597 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-10-25 00:18:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-10-25 00:18:55,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-25 00:18:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:18:55,599 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-25 00:18:55,599 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:18:55,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2024-10-25 00:18:55,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:55,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:55,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:55,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:55,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:18:55,600 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-10-25 00:18:55,600 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-10-25 00:18:55,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash -583325541, now seen corresponding path program 1 times [2024-10-25 00:18:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260968226] [2024-10-25 00:18:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:55,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:55,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:55,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:55,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 4 times [2024-10-25 00:18:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128283337] [2024-10-25 00:18:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:55,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:55,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash 678523240, now seen corresponding path program 2 times [2024-10-25 00:18:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815453817] [2024-10-25 00:18:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815453817] [2024-10-25 00:18:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815453817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:18:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445012301] [2024-10-25 00:18:55,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:18:55,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:18:55,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:55,737 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-10-25 00:18:55,738 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-10-25 00:18:55,786 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:18:55,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:18:55,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-25 00:18:55,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:55,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:18:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445012301] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:18:55,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:18:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-25 00:18:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898341115] [2024-10-25 00:18:55,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:18:56,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:56,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 00:18:56,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-25 00:18:56,070 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-10-25 00:18:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:56,169 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-10-25 00:18:56,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2024-10-25 00:18:56,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-10-25 00:18:56,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 86 transitions. [2024-10-25 00:18:56,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-10-25 00:18:56,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-10-25 00:18:56,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2024-10-25 00:18:56,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:56,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-10-25 00:18:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2024-10-25 00:18:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2024-10-25 00:18:56,175 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-10-25 00:18:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-25 00:18:56,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-25 00:18:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:18:56,177 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-25 00:18:56,177 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:18:56,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2024-10-25 00:18:56,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-10-25 00:18:56,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:56,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:56,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:56,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:18:56,178 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-10-25 00:18:56,178 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-10-25 00:18:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1530158845, now seen corresponding path program 2 times [2024-10-25 00:18:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:56,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905638804] [2024-10-25 00:18:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:56,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:56,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 5 times [2024-10-25 00:18:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789692834] [2024-10-25 00:18:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:56,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:56,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1481430602, now seen corresponding path program 3 times [2024-10-25 00:18:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:56,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798483757] [2024-10-25 00:18:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:56,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:56,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:56,814 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:18:56,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:18:56,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:18:56,814 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:18:56,814 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:18:56,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:56,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:18:56,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:18:56,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration9_Lasso [2024-10-25 00:18:56,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:18:56,815 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:18:56,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:56,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:57,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:57,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:57,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:57,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:57,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:57,533 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:18:57,533 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:18:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,535 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-10-25 00:18:57,536 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-10-25 00:18:57,540 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-10-25 00:18:57,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:57,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,569 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-10-25 00:18:57,570 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-10-25 00:18:57,570 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-10-25 00:18:57,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,597 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-10-25 00:18:57,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,599 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-10-25 00:18:57,600 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-10-25 00:18:57,601 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-10-25 00:18:57,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,628 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-10-25 00:18:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,630 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-10-25 00:18:57,631 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-10-25 00:18:57,632 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-10-25 00:18:57,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-25 00:18:57,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,659 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-10-25 00:18:57,660 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-10-25 00:18:57,662 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-10-25 00:18:57,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,684 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-10-25 00:18:57,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,685 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-10-25 00:18:57,687 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-10-25 00:18:57,687 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-10-25 00:18:57,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,710 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-10-25 00:18:57,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,711 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-10-25 00:18:57,712 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-10-25 00:18:57,713 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-10-25 00:18:57,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,735 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-10-25 00:18:57,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,737 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-10-25 00:18:57,739 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-10-25 00:18:57,739 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-10-25 00:18:57,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,765 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-10-25 00:18:57,766 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-10-25 00:18:57,767 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-10-25 00:18:57,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,790 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-10-25 00:18:57,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,791 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-10-25 00:18:57,792 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-10-25 00:18:57,792 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-10-25 00:18:57,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:57,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:57,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:57,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,816 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-10-25 00:18:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,818 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-10-25 00:18:57,819 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-10-25 00:18:57,820 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-10-25 00:18:57,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,846 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-10-25 00:18:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,848 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-10-25 00:18:57,849 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-10-25 00:18:57,851 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-10-25 00:18:57,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,877 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-10-25 00:18:57,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,879 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-10-25 00:18:57,879 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-10-25 00:18:57,880 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-10-25 00:18:57,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-25 00:18:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,906 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-10-25 00:18:57,906 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-10-25 00:18:57,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-10-25 00:18:57,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,932 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-10-25 00:18:57,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,933 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-10-25 00:18:57,934 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-10-25 00:18:57,935 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-10-25 00:18:57,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,961 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-10-25 00:18:57,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,962 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-10-25 00:18:57,964 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-10-25 00:18:57,964 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-10-25 00:18:57,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:57,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:57,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:57,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:57,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:57,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:57,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:57,991 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-10-25 00:18:57,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:57,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:57,993 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-10-25 00:18:57,994 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-10-25 00:18:57,995 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-10-25 00:18:58,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:58,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:58,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:58,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:58,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:58,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:58,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:58,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:58,020 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-10-25 00:18:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:58,024 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-10-25 00:18:58,027 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-10-25 00:18:58,027 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-10-25 00:18:58,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:58,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:58,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:58,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:58,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:58,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:58,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:18:58,072 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-25 00:18:58,073 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-10-25 00:18:58,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:58,075 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-10-25 00:18:58,076 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-10-25 00:18:58,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:18:58,088 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:18:58,088 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:18:58,088 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-10-25 00:18:58,101 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-10-25 00:18:58,128 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-10-25 00:18:58,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-10-25 00:18:58,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:18:58,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:18:58,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:58,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:18:58,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:58,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:18:58,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:58,251 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-10-25 00:18:58,251 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-10-25 00:18:58,335 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-10-25 00:18:58,382 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-10-25 00:18:58,383 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-10-25 00:18:58,383 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-10-25 00:18:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2024-10-25 00:18:58,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-25 00:18:58,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:58,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 21 letters. Loop has 6 letters. [2024-10-25 00:18:58,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:58,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 12 letters. [2024-10-25 00:18:58,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:58,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 126 transitions. [2024-10-25 00:18:58,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-25 00:18:58,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 92 states and 124 transitions. [2024-10-25 00:18:58,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-25 00:18:58,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-10-25 00:18:58,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 124 transitions. [2024-10-25 00:18:58,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:58,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-10-25 00:18:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 124 transitions. [2024-10-25 00:18:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2024-10-25 00:18:58,390 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-10-25 00:18:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-10-25 00:18:58,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-10-25 00:18:58,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-10-25 00:18:58,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:18:58,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 90 transitions. [2024-10-25 00:18:58,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-25 00:18:58,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:58,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:58,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:58,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-25 00:18:58,392 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-10-25 00:18:58,392 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-10-25 00:18:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 67745056, now seen corresponding path program 1 times [2024-10-25 00:18:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76834137] [2024-10-25 00:18:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:58,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:58,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:58,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 2 times [2024-10-25 00:18:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772651996] [2024-10-25 00:18:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:58,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:58,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -804574741, now seen corresponding path program 1 times [2024-10-25 00:18:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240590619] [2024-10-25 00:18:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:58,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:58,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:59,783 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:18:59,783 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:18:59,783 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:18:59,783 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:18:59,783 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:18:59,783 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:59,783 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:18:59,784 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:18:59,784 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration10_Lasso [2024-10-25 00:18:59,784 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:18:59,784 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:18:59,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:59,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:59,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:59,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:59,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:00,362 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:00,362 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:00,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:00,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:00,364 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-10-25 00:19:00,365 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-10-25 00:19:00,366 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-10-25 00:19:00,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:00,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:00,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:00,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:00,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:00,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:00,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:00,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:00,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:00,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:00,391 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-10-25 00:19:00,392 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-10-25 00:19:00,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:19:00,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:00,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:00,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:00,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:00,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:00,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:00,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:00,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:00,415 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-10-25 00:19:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:00,417 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-10-25 00:19:00,418 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-10-25 00:19:00,418 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-10-25 00:19:00,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:00,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:00,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:00,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:00,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:00,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:00,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:00,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:00,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-25 00:19:00,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:00,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:00,445 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-10-25 00:19:00,447 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-10-25 00:19:00,447 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-10-25 00:19:00,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:00,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:00,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:00,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:00,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:00,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:00,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:00,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:00,469 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-10-25 00:19:00,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:00,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:00,471 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-10-25 00:19:00,471 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-10-25 00:19:00,472 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-10-25 00:19:00,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:00,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:00,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:00,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:00,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:00,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:00,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:00,504 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-25 00:19:00,504 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-25 00:19:00,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:00,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:00,505 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-10-25 00:19:00,506 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-10-25 00:19:00,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:00,517 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:00,517 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:00,518 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-10-25 00:19:00,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:00,537 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-25 00:19:00,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-10-25 00:19:00,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:19:00,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:19:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:00,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:00,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:00,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:19:00,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:00,601 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-10-25 00:19:00,601 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-10-25 00:19:00,612 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-10-25 00:19:00,612 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-10-25 00:19:00,613 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-10-25 00:19:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-10-25 00:19:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 4 letters. [2024-10-25 00:19:00,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 21 letters. Loop has 4 letters. [2024-10-25 00:19:00,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:00,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 8 letters. [2024-10-25 00:19:00,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:00,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2024-10-25 00:19:00,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-25 00:19:00,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 46 states and 61 transitions. [2024-10-25 00:19:00,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-25 00:19:00,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-25 00:19:00,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 61 transitions. [2024-10-25 00:19:00,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:00,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-25 00:19:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 61 transitions. [2024-10-25 00:19:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-25 00:19:00,616 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-10-25 00:19:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-10-25 00:19:00,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-25 00:19:00,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-25 00:19:00,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:19:00,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2024-10-25 00:19:00,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-25 00:19:00,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:00,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:00,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:00,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:19:00,617 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-10-25 00:19:00,617 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-10-25 00:19:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash -606279004, now seen corresponding path program 4 times [2024-10-25 00:19:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961241707] [2024-10-25 00:19:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:00,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:00,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:00,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 64187797, now seen corresponding path program 2 times [2024-10-25 00:19:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485875695] [2024-10-25 00:19:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:00,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:00,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:00,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1784762158, now seen corresponding path program 1 times [2024-10-25 00:19:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252739096] [2024-10-25 00:19:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:00,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:00,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:01,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-25 00:19:01,314 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:01,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:01,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:01,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:01,314 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:01,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:01,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:01,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration11_Lasso [2024-10-25 00:19:01,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:01,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:01,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:01,855 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:01,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:01,857 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-10-25 00:19:01,858 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-10-25 00:19:01,858 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-10-25 00:19:01,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:01,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:01,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:01,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:01,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:01,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:01,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:01,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-25 00:19:01,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:01,884 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-10-25 00:19:01,885 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-10-25 00:19:01,886 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-10-25 00:19:01,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:01,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:01,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:01,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:01,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:01,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:01,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:01,910 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-10-25 00:19:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:01,912 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-10-25 00:19:01,913 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-10-25 00:19:01,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-10-25 00:19:01,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:01,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:01,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:01,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:01,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:01,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:01,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:01,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:01,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:01,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:01,940 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-10-25 00:19:01,941 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-10-25 00:19:01,942 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-10-25 00:19:01,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:01,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:01,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:01,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:01,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:01,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:01,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:01,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:01,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:01,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:01,966 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-10-25 00:19:01,967 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-10-25 00:19:01,967 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-10-25 00:19:01,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:01,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:01,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:01,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:01,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:01,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:01,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:01,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:01,989 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-10-25 00:19:01,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:01,991 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-10-25 00:19:01,991 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-10-25 00:19:01,992 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-10-25 00:19:02,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:02,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:02,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:02,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:02,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:02,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:02,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:02,015 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-10-25 00:19:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:02,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:02,016 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-10-25 00:19:02,017 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-10-25 00:19:02,018 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-10-25 00:19:02,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:02,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:02,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:02,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:02,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:02,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:02,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:02,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:02,039 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-10-25 00:19:02,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:02,041 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-10-25 00:19:02,041 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-10-25 00:19:02,042 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-10-25 00:19:02,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:02,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:02,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:02,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:02,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:02,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:02,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:02,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:02,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:02,068 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-10-25 00:19:02,068 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-10-25 00:19:02,069 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-10-25 00:19:02,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:02,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:02,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:02,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:02,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:02,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:02,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:02,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:02,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:02,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:02,095 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-10-25 00:19:02,095 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-10-25 00:19:02,096 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-10-25 00:19:02,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:02,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:02,107 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-25 00:19:02,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:02,116 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-25 00:19:02,117 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-25 00:19:02,139 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:02,186 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-10-25 00:19:02,186 INFO L444 ModelExtractionUtils]: 12 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-10-25 00:19:02,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:02,187 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-10-25 00:19:02,188 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-10-25 00:19:02,188 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:02,200 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-10-25 00:19:02,201 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:02,201 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-10-25 00:19:02,212 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-10-25 00:19:02,219 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-10-25 00:19:02,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-10-25 00:19:02,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:02,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:19:02,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:02,304 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-10-25 00:19:02,305 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-10-25 00:19:02,329 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-10-25 00:19:02,329 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-10-25 00:19:02,329 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-10-25 00:19:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-10-25 00:19:02,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 19 letters. Loop has 5 letters. [2024-10-25 00:19:02,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:02,330 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:19:02,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:02,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:19:02,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:02,413 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-10-25 00:19:02,414 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-10-25 00:19:02,471 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-10-25 00:19:02,475 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-10-25 00:19:02,475 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-10-25 00:19:02,476 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-10-25 00:19:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2024-10-25 00:19:02,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 19 letters. Loop has 5 letters. [2024-10-25 00:19:02,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:02,476 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:19:02,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:02,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:19:02,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:02,567 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-10-25 00:19:02,568 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-10-25 00:19:02,598 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-10-25 00:19:02,599 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-10-25 00:19:02,600 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-10-25 00:19:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2024-10-25 00:19:02,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 5 letters. [2024-10-25 00:19:02,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:02,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 24 letters. Loop has 5 letters. [2024-10-25 00:19:02,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:02,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 10 letters. [2024-10-25 00:19:02,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:02,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 175 transitions. [2024-10-25 00:19:02,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2024-10-25 00:19:02,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 101 states and 139 transitions. [2024-10-25 00:19:02,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-25 00:19:02,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-10-25 00:19:02,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 139 transitions. [2024-10-25 00:19:02,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:02,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 139 transitions. [2024-10-25 00:19:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 139 transitions. [2024-10-25 00:19:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2024-10-25 00:19:02,615 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-10-25 00:19:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-10-25 00:19:02,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-10-25 00:19:02,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-10-25 00:19:02,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-25 00:19:02,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 121 transitions. [2024-10-25 00:19:02,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-10-25 00:19:02,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:02,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:02,617 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:02,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:19:02,617 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-10-25 00:19:02,617 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-10-25 00:19:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -604616314, now seen corresponding path program 1 times [2024-10-25 00:19:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:02,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714316298] [2024-10-25 00:19:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 00:19:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714316298] [2024-10-25 00:19:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714316298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:19:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:19:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:19:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037749766] [2024-10-25 00:19:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:19:02,654 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:02,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 6 times [2024-10-25 00:19:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772267109] [2024-10-25 00:19:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:19:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:19:02,821 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-10-25 00:19:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:02,849 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2024-10-25 00:19:02,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 117 transitions. [2024-10-25 00:19:02,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-10-25 00:19:02,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 84 states and 114 transitions. [2024-10-25 00:19:02,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-25 00:19:02,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-25 00:19:02,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 114 transitions. [2024-10-25 00:19:02,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:02,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 114 transitions. [2024-10-25 00:19:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 114 transitions. [2024-10-25 00:19:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-10-25 00:19:02,858 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-10-25 00:19:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-25 00:19:02,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-25 00:19:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:19:02,863 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-25 00:19:02,863 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-25 00:19:02,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 108 transitions. [2024-10-25 00:19:02,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-10-25 00:19:02,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:02,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:02,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:02,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:19:02,865 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-10-25 00:19:02,865 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-10-25 00:19:02,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,866 INFO L85 PathProgramCache]: Analyzing trace with hash -604675896, now seen corresponding path program 1 times [2024-10-25 00:19:02,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:02,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229147978] [2024-10-25 00:19:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 7 times [2024-10-25 00:19:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568079133] [2024-10-25 00:19:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1188823131, now seen corresponding path program 1 times [2024-10-25 00:19:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852791143] [2024-10-25 00:19:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:02,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:03,560 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:19:03,560 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:19:03,560 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:19:03,560 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:19:03,560 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:19:03,560 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:03,560 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:19:03,560 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:19:03,560 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration13_Lasso [2024-10-25 00:19:03,560 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:19:03,560 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:19:03,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:03,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:19:04,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:19:04,169 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:19:04,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,180 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-10-25 00:19:04,184 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-10-25 00:19:04,184 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-10-25 00:19:04,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:04,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:04,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:04,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,209 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-10-25 00:19:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,230 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-10-25 00:19:04,231 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-10-25 00:19:04,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-10-25 00:19:04,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:04,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:04,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:04,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,259 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-10-25 00:19:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,260 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-10-25 00:19:04,262 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-10-25 00:19:04,262 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-10-25 00:19:04,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:04,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:04,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:04,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,284 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-10-25 00:19:04,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,286 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-10-25 00:19:04,287 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-10-25 00:19:04,287 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-10-25 00:19:04,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:04,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:04,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-25 00:19:04,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,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-10-25 00:19:04,313 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-10-25 00:19:04,315 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-10-25 00:19:04,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:04,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:04,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,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-10-25 00:19:04,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,341 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-10-25 00:19:04,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-10-25 00:19:04,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-10-25 00:19:04,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:19:04,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:19:04,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:19:04,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-25 00:19:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,399 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-10-25 00:19:04,400 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-10-25 00:19:04,400 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-10-25 00:19:04,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,411 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-25 00:19:04,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,419 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-25 00:19:04,419 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-25 00:19:04,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,444 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-10-25 00:19:04,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,446 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-10-25 00:19:04,447 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-10-25 00:19:04,448 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-10-25 00:19:04,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:04,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:04,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:19:04,472 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-10-25 00:19:04,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,473 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-10-25 00:19:04,474 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-10-25 00:19:04,476 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-10-25 00:19:04,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:19:04,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:19:04,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:19:04,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:19:04,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:19:04,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:19:04,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:19:04,512 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-25 00:19:04,512 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:19:04,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:19:04,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,514 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-10-25 00:19:04,514 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-10-25 00:19:04,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:19:04,526 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:19:04,526 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:19:04,526 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-10-25 00:19:04,538 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-10-25 00:19:04,551 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-10-25 00:19:04,552 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-10-25 00:19:04,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-25 00:19:04,553 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-25 00:19:04,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:04,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:19:04,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:04,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:19:04,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:04,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-25 00:19:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:19:04,656 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-10-25 00:19:04,656 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-10-25 00:19:04,683 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-10-25 00:19:04,687 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-10-25 00:19:04,688 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-10-25 00:19:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-10-25 00:19:04,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 6 letters. [2024-10-25 00:19:04,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:04,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 25 letters. Loop has 6 letters. [2024-10-25 00:19:04,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:04,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 12 letters. [2024-10-25 00:19:04,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:19:04,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 307 transitions. [2024-10-25 00:19:04,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2024-10-25 00:19:04,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 150 states and 219 transitions. [2024-10-25 00:19:04,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-25 00:19:04,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-25 00:19:04,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 219 transitions. [2024-10-25 00:19:04,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:19:04,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-10-25 00:19:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 219 transitions. [2024-10-25 00:19:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 110. [2024-10-25 00:19:04,703 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-10-25 00:19:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-10-25 00:19:04,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-10-25 00:19:04,704 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-10-25 00:19:04,704 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-25 00:19:04,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 161 transitions. [2024-10-25 00:19:04,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-10-25 00:19:04,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:19:04,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:19:04,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:19:04,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:19:04,706 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-10-25 00:19:04,706 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-10-25 00:19:04,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash -604675898, now seen corresponding path program 2 times [2024-10-25 00:19:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579664089] [2024-10-25 00:19:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:19:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 00:19:04,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:19:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579664089] [2024-10-25 00:19:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579664089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:19:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660630195] [2024-10-25 00:19:04,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:19:04,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:19:04,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:19:04,775 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-10-25 00:19:04,780 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-10-25 00:19:04,836 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:19:04,836 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:19:04,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-25 00:19:04,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:19:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 00:19:04,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:19:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 00:19:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660630195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:19:04,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:19:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-10-25 00:19:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651436477] [2024-10-25 00:19:04,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:19:04,873 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:19:04,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:19:04,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 8 times [2024-10-25 00:19:04,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:19:04,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614242093] [2024-10-25 00:19:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:19:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:19:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:04,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:19:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:19:04,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:19:05,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:19:05,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:19:05,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:19:05,036 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-10-25 00:19:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:19:05,090 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-10-25 00:19:05,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 87 transitions. [2024-10-25 00:19:05,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:19:05,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2024-10-25 00:19:05,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:19:05,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:19:05,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:19:05,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:19:05,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:19:05,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:19:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:19:05,092 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:19:05,092 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-25 00:19:05,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:19:05,092 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:19:05,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:19:05,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:19:05 BoogieIcfgContainer [2024-10-25 00:19:05,098 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:19:05,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:19:05,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:19:05,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:19:05,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:50" (3/4) ... [2024-10-25 00:19:05,100 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:19:05,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:19:05,101 INFO L158 Benchmark]: Toolchain (without parser) took 15179.74ms. Allocated memory was 140.5MB in the beginning and 314.6MB in the end (delta: 174.1MB). Free memory was 71.5MB in the beginning and 206.3MB in the end (delta: -134.8MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-10-25 00:19:05,101 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:19:05,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.13ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 109.1MB in the end (delta: -37.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-25 00:19:05,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.62ms. Allocated memory is still 140.5MB. Free memory was 109.1MB in the beginning and 107.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:19:05,101 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 140.5MB. Free memory was 107.8MB in the beginning and 105.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:19:05,102 INFO L158 Benchmark]: RCFGBuilder took 291.93ms. Allocated memory is still 140.5MB. Free memory was 105.7MB in the beginning and 91.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-25 00:19:05,102 INFO L158 Benchmark]: BuchiAutomizer took 14606.91ms. Allocated memory was 140.5MB in the beginning and 314.6MB in the end (delta: 174.1MB). Free memory was 91.5MB in the beginning and 206.3MB in the end (delta: -114.8MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-10-25 00:19:05,102 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 314.6MB. Free memory is still 206.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:19:05,103 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.14ms. Allocated memory is still 102.8MB. Free memory is still 71.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.13ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 109.1MB in the end (delta: -37.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.62ms. Allocated memory is still 140.5MB. Free memory was 109.1MB in the beginning and 107.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 140.5MB. Free memory was 107.8MB in the beginning and 105.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.93ms. Allocated memory is still 140.5MB. Free memory was 105.7MB in the beginning and 91.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 14606.91ms. Allocated memory was 140.5MB in the beginning and 314.6MB in the end (delta: 174.1MB). Free memory was 91.5MB in the beginning and 206.3MB in the end (delta: -114.8MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 314.6MB. Free memory is still 206.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 14.5s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 12.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. 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: 107ms 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-10-25 00:19:05,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2024-10-25 00:19:05,322 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-10-25 00:19:05,522 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-10-25 00:19:05,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-25 00:19:05,927 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