./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 803cd42f 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 ../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-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:35:04,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:35:04,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:35:04,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:35:04,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:35:04,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:35:04,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:35:04,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:35:04,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:35:04,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:35:04,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:35:04,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:35:04,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:35:04,778 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:35:04,778 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:35:04,778 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:35:04,779 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:35:04,779 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:35:04,779 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:35:04,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:35:04,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:35:04,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:35:04,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:35:04,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:35:04,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:35:04,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:35:04,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:35:04,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:35:04,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:35:04,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:35:04,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:35:04,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:35:04,784 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:35:04,785 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 [2024-11-23 02:35:05,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:35:05,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:35:05,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:35:05,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:35:05,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:35:05,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-23 02:35:06,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:35:06,437 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:35:06,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-23 02:35:06,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a9362d4/cd20b7b641ad4bc4a54c93640e209c10/FLAGd58322556 [2024-11-23 02:35:06,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a9362d4/cd20b7b641ad4bc4a54c93640e209c10 [2024-11-23 02:35:06,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:35:06,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:35:06,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:35:06,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:35:06,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:35:06,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:06" (1/1) ... [2024-11-23 02:35:06,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c61bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:06, skipping insertion in model container [2024-11-23 02:35:06,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:35:06" (1/1) ... [2024-11-23 02:35:06,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:35:07,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:35:07,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:35:07,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:35:07,080 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:35:07,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07 WrapperNode [2024-11-23 02:35:07,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:35:07,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:35:07,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:35:07,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:35:07,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,106 INFO L138 Inliner]: procedures = 15, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2024-11-23 02:35:07,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:35:07,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:35:07,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:35:07,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:35:07,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,127 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-23 02:35:07,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:35:07,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:35:07,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:35:07,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:35:07,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (1/1) ... [2024-11-23 02:35:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:07,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:07,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:35:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:35:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:35:07,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:35:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:35:07,299 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:35:07,301 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:35:07,551 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-23 02:35:07,552 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:35:07,564 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:35:07,566 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-23 02:35:07,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:07 BoogieIcfgContainer [2024-11-23 02:35:07,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:35:07,567 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:35:07,567 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:35:07,570 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:35:07,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:35:07,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:35:06" (1/3) ... [2024-11-23 02:35:07,573 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15b4908d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:35:07, skipping insertion in model container [2024-11-23 02:35:07,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:35:07,573 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:35:07" (2/3) ... [2024-11-23 02:35:07,574 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15b4908d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:35:07, skipping insertion in model container [2024-11-23 02:35:07,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:35:07,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:07" (3/3) ... [2024-11-23 02:35:07,576 INFO L332 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1-2.c [2024-11-23 02:35:07,630 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:35:07,630 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:35:07,630 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:35:07,632 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:35:07,632 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:35:07,632 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:35:07,632 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:35:07,633 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:35:07,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:07,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-23 02:35:07,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:07,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:07,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:35:07,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:35:07,658 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:35:07,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:07,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-11-23 02:35:07,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:07,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:07,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:35:07,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:35:07,668 INFO L745 eck$LassoCheckResult]: Stem: 25#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13#L15true assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 24#L20-3true [2024-11-23 02:35:07,668 INFO L747 eck$LassoCheckResult]: Loop: 24#L20-3true assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 8#L20-2true main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 24#L20-3true [2024-11-23 02:35:07,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-23 02:35:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337705290] [2024-11-23 02:35:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:07,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:07,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:07,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-23 02:35:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811582579] [2024-11-23 02:35:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:07,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:07,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:07,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-23 02:35:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712993640] [2024-11-23 02:35:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:07,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:07,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:08,202 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:35:08,203 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:35:08,203 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:35:08,203 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:35:08,203 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:35:08,203 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,203 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:35:08,203 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:35:08,203 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration1_Lasso [2024-11-23 02:35:08,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:35:08,204 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:35:08,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:08,836 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:35:08,840 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:35:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:08,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:08,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-23 02:35:08,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:08,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:08,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:08,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:08,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:08,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:08,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:08,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:08,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:08,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:08,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:08,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-23 02:35:08,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:08,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:08,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:08,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:08,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:08,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:08,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:08,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:08,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:08,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:08,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:08,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-23 02:35:08,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:08,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:08,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:08,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:08,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:08,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:08,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:08,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:08,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-23 02:35:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:08,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:08,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:35:08,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:08,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:08,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:08,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:08,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:08,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:08,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:08,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:08,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:08,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-23 02:35:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:08,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:08,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 02:35:08,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:08,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:08,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:08,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:08,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:08,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:08,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:08,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:08,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:08,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:08,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:08,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:08,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-23 02:35:08,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:09,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:09,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:09,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:09,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:09,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:09,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:09,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:09,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:09,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-23 02:35:09,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:09,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:09,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:09,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-23 02:35:09,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-11-23 02:35:09,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:09,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:09,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:09,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:09,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:09,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:09,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:09,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-23 02:35:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:09,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:09,042 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:09,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-23 02:35:09,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:09,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:09,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:09,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:09,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:09,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:09,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:09,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:09,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-23 02:35:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:09,069 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:09,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-23 02:35:09,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:09,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:09,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:09,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:09,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:09,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:09,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:09,105 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:35:09,135 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-23 02:35:09,135 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-23 02:35:09,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:09,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:09,160 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-23 02:35:09,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:35:09,175 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-23 02:35:09,175 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:35:09,176 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~#v~0#1.offset >= 0] [2024-11-23 02:35:09,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-23 02:35:09,198 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-23 02:35:09,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:35:09,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:35:09,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:09,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:35:09,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:09,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 02:35:09,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:09,314 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:35:09,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,376 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 71 transitions. Complement of second has 6 states. [2024-11-23 02:35:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-23 02:35:09,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-23 02:35:09,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:09,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-23 02:35:09,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:09,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-23 02:35:09,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:09,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2024-11-23 02:35:09,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-23 02:35:09,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 22 states and 31 transitions. [2024-11-23 02:35:09,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-23 02:35:09,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-23 02:35:09,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-11-23 02:35:09,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:35:09,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-23 02:35:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-11-23 02:35:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-23 02:35:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2024-11-23 02:35:09,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-23 02:35:09,426 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-23 02:35:09,426 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:35:09,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2024-11-23 02:35:09,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2024-11-23 02:35:09,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:09,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:09,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:35:09,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:35:09,427 INFO L745 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 149#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 150#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 157#L20-4 main_~j~0#1 := 1; 156#L22-3 [2024-11-23 02:35:09,428 INFO L747 eck$LassoCheckResult]: Loop: 156#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 158#L25-5 assume !true; 146#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 155#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 156#L22-3 [2024-11-23 02:35:09,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2024-11-23 02:35:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428451597] [2024-11-23 02:35:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:09,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-23 02:35:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:09,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1841148, now seen corresponding path program 1 times [2024-11-23 02:35:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407348900] [2024-11-23 02:35:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407348900] [2024-11-23 02:35:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407348900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:35:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:35:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 02:35:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812239923] [2024-11-23 02:35:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:35:09,531 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:35:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 02:35:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 02:35:09,534 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 12 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:09,539 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-11-23 02:35:09,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-11-23 02:35:09,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:09,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-11-23 02:35:09,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-23 02:35:09,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-23 02:35:09,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-23 02:35:09,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:35:09,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-23 02:35:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-23 02:35:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-23 02:35:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-23 02:35:09,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-23 02:35:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 02:35:09,544 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-23 02:35:09,544 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:35:09,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-23 02:35:09,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:09,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:09,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:09,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:35:09,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:09,545 INFO L745 eck$LassoCheckResult]: Stem: 210#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 196#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 197#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 205#L20-4 main_~j~0#1 := 1; 204#L22-3 [2024-11-23 02:35:09,545 INFO L747 eck$LassoCheckResult]: Loop: 204#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 206#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 198#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 193#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 194#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 203#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 204#L22-3 [2024-11-23 02:35:09,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 2 times [2024-11-23 02:35:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232416241] [2024-11-23 02:35:09,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:09,565 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:35:09,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:09,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:09,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 1 times [2024-11-23 02:35:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489255366] [2024-11-23 02:35:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:09,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -823994471, now seen corresponding path program 1 times [2024-11-23 02:35:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968767791] [2024-11-23 02:35:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968767791] [2024-11-23 02:35:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968767791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:35:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:35:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:35:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148051365] [2024-11-23 02:35:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:35:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:35:09,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:35:09,918 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:09,957 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-23 02:35:09,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2024-11-23 02:35:09,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:09,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 26 transitions. [2024-11-23 02:35:09,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-23 02:35:09,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-23 02:35:09,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-11-23 02:35:09,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:35:09,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-23 02:35:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-11-23 02:35:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-23 02:35:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-23 02:35:09,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-23 02:35:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:35:09,963 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-23 02:35:09,963 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:35:09,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-23 02:35:09,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:09,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:09,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:09,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:09,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:09,966 INFO L745 eck$LassoCheckResult]: Stem: 265#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 252#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 253#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 263#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 264#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 260#L20-4 main_~j~0#1 := 1; 258#L22-3 [2024-11-23 02:35:09,966 INFO L747 eck$LassoCheckResult]: Loop: 258#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 261#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 251#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 248#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 249#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 257#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 258#L22-3 [2024-11-23 02:35:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2024-11-23 02:35:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370249386] [2024-11-23 02:35:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:09,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:09,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1750294158, now seen corresponding path program 2 times [2024-11-23 02:35:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075007835] [2024-11-23 02:35:09,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:35:10,006 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:10,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -48611717, now seen corresponding path program 1 times [2024-11-23 02:35:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984117954] [2024-11-23 02:35:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984117954] [2024-11-23 02:35:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984117954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:35:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882213604] [2024-11-23 02:35:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:35:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:10,155 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:35:10,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 02:35:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:10,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:35:10,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:10,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:35:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882213604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:35:10,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:35:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-23 02:35:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797490392] [2024-11-23 02:35:10,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:35:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:10,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 02:35:10,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-23 02:35:10,478 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:10,545 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-11-23 02:35:10,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2024-11-23 02:35:10,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-11-23 02:35:10,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 48 transitions. [2024-11-23 02:35:10,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-23 02:35:10,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-23 02:35:10,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2024-11-23 02:35:10,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:35:10,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-23 02:35:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2024-11-23 02:35:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2024-11-23 02:35:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-11-23 02:35:10,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-23 02:35:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:35:10,549 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-11-23 02:35:10,550 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:35:10,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-11-23 02:35:10,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:10,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:10,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:10,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:10,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:35:10,551 INFO L745 eck$LassoCheckResult]: Stem: 413#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 396#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 397#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 409#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 414#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 405#L20-4 main_~j~0#1 := 1; 406#L22-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 400#L22-4 main_~k~0#1 := 1; 401#L32-3 [2024-11-23 02:35:10,551 INFO L747 eck$LassoCheckResult]: Loop: 401#L32-3 assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 408#L6 assume !(0 == __VERIFIER_assert_~cond#1); 391#L6-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 392#L32-2 main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 401#L32-3 [2024-11-23 02:35:10,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243825, now seen corresponding path program 1 times [2024-11-23 02:35:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884086861] [2024-11-23 02:35:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:10,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 1 times [2024-11-23 02:35:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032170157] [2024-11-23 02:35:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash -78992900, now seen corresponding path program 1 times [2024-11-23 02:35:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160116261] [2024-11-23 02:35:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160116261] [2024-11-23 02:35:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160116261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:35:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694496542] [2024-11-23 02:35:10,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:35:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:10,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:35:10,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 02:35:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:10,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:35:10,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 02:35:10,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 02:35:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694496542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:35:10,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 02:35:10,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-23 02:35:10,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024046384] [2024-11-23 02:35:10,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:35:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:35:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-23 02:35:10,806 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:10,831 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-23 02:35:10,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2024-11-23 02:35:10,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-23 02:35:10,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 38 transitions. [2024-11-23 02:35:10,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-23 02:35:10,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-23 02:35:10,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-23 02:35:10,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:35:10,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-23 02:35:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-23 02:35:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-11-23 02:35:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-23 02:35:10,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-23 02:35:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 02:35:10,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-23 02:35:10,840 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:35:10,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-23 02:35:10,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:10,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:10,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:10,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:10,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:35:10,843 INFO L745 eck$LassoCheckResult]: Stem: 519#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 503#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 504#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 516#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 517#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 518#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 520#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 512#L20-4 main_~j~0#1 := 1; 513#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 514#L25-5 [2024-11-23 02:35:10,843 INFO L747 eck$LassoCheckResult]: Loop: 514#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 505#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 500#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 502#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 506#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 514#L25-5 [2024-11-23 02:35:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash -873401203, now seen corresponding path program 1 times [2024-11-23 02:35:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219903124] [2024-11-23 02:35:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash 61175917, now seen corresponding path program 1 times [2024-11-23 02:35:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132816943] [2024-11-23 02:35:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:10,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:10,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2064874337, now seen corresponding path program 1 times [2024-11-23 02:35:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:10,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458033] [2024-11-23 02:35:10,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:10,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:10,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:11,273 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:35:11,273 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:35:11,273 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:35:11,273 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:35:11,274 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:35:11,274 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,274 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:35:11,276 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:35:11,276 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration6_Lasso [2024-11-23 02:35:11,277 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:35:11,277 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:35:11,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:11,816 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:35:11,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:35:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-23 02:35:11,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-11-23 02:35:11,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:11,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:11,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:11,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:11,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:11,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:11,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:11,844 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-11-23 02:35:11,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-23 02:35:11,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:11,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:11,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:11,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:11,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:11,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:11,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:11,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:11,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,874 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-23 02:35:11,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:11,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:11,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:11,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:11,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:11,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:11,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:11,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:11,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-23 02:35:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,900 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-23 02:35:11,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:11,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:11,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:11,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:11,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:11,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:11,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:11,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:11,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-23 02:35:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,943 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-23 02:35:11,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:11,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:11,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:11,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:11,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:11,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:11,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:11,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:11,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:11,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,970 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-23 02:35:11,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:11,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:11,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:11,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:11,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:11,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:11,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:11,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:11,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:11,996 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-23 02:35:11,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:12,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:12,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:12,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:12,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:12,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:12,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:12,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:12,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-23 02:35:12,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:12,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:12,026 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:12,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-23 02:35:12,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:12,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:12,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:12,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:12,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:12,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:12,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:12,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:12,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-23 02:35:12,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:12,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:12,055 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:12,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-23 02:35:12,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:12,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:12,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:12,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:12,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:12,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:12,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:12,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:35:12,078 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-23 02:35:12,079 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-23 02:35:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:12,080 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:12,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-23 02:35:12,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:35:12,092 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:35:12,092 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:35:12,092 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-23 02:35:12,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-23 02:35:12,110 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-23 02:35:12,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:12,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:35:12,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:12,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 02:35:12,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:12,203 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:35:12,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:12,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 51 transitions. Complement of second has 9 states. [2024-11-23 02:35:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2024-11-23 02:35:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-23 02:35:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2024-11-23 02:35:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2024-11-23 02:35:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:12,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2024-11-23 02:35:12,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:12,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 45 transitions. [2024-11-23 02:35:12,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-23 02:35:12,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:35:12,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2024-11-23 02:35:12,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:12,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-23 02:35:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2024-11-23 02:35:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-23 02:35:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-23 02:35:12,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-23 02:35:12,252 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-23 02:35:12,252 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:35:12,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2024-11-23 02:35:12,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:12,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:12,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:12,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:12,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:12,253 INFO L745 eck$LassoCheckResult]: Stem: 683#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 664#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 665#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 680#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 681#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 682#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 686#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 677#L20-4 main_~j~0#1 := 1; 678#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 684#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 662#L25-1 assume !main_#t~short9#1; 658#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 659#L25-6 [2024-11-23 02:35:12,253 INFO L747 eck$LassoCheckResult]: Loop: 659#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 671#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 672#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 674#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 675#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 685#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 659#L25-6 [2024-11-23 02:35:12,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:12,253 INFO L85 PathProgramCache]: Analyzing trace with hash -583325479, now seen corresponding path program 1 times [2024-11-23 02:35:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:12,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315644983] [2024-11-23 02:35:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:12,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-23 02:35:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:35:12,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:12,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315644983] [2024-11-23 02:35:12,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315644983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:35:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:35:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 02:35:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869752521] [2024-11-23 02:35:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:35:12,318 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:35:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 3 times [2024-11-23 02:35:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386541288] [2024-11-23 02:35:12,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:35:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:12,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:35:12,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:12,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:12,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 02:35:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 02:35:12,447 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:12,493 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-23 02:35:12,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2024-11-23 02:35:12,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-23 02:35:12,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2024-11-23 02:35:12,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-23 02:35:12,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-23 02:35:12,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2024-11-23 02:35:12,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:12,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-11-23 02:35:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2024-11-23 02:35:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-23 02:35:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-23 02:35:12,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-23 02:35:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:35:12,497 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-23 02:35:12,497 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:35:12,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2024-11-23 02:35:12,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:12,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:12,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:12,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:12,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:12,500 INFO L745 eck$LassoCheckResult]: Stem: 769#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 748#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 749#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 766#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 767#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 768#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 771#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 762#L20-4 main_~j~0#1 := 1; 763#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 758#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 746#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 742#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 743#L25-6 [2024-11-23 02:35:12,500 INFO L747 eck$LassoCheckResult]: Loop: 743#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 755#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 756#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 765#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 772#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 770#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 743#L25-6 [2024-11-23 02:35:12,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash -583325541, now seen corresponding path program 1 times [2024-11-23 02:35:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479952965] [2024-11-23 02:35:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:12,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:12,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:12,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 4 times [2024-11-23 02:35:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333984671] [2024-11-23 02:35:12,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:35:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:12,536 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:35:12,536 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:12,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:12,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:12,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash 678523240, now seen corresponding path program 2 times [2024-11-23 02:35:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:12,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658008131] [2024-11-23 02:35:12,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:12,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:35:12,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:35:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:12,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:12,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658008131] [2024-11-23 02:35:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658008131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:35:12,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981348960] [2024-11-23 02:35:12,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:12,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:35:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:12,666 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:35:12,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-23 02:35:12,711 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:35:12,712 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:35:12,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 02:35:12,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:12,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:35:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981348960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:35:12,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:35:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-23 02:35:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6037817] [2024-11-23 02:35:12,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:35:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 02:35:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-23 02:35:12,976 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:13,079 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-11-23 02:35:13,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2024-11-23 02:35:13,080 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2024-11-23 02:35:13,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 86 transitions. [2024-11-23 02:35:13,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-23 02:35:13,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-23 02:35:13,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2024-11-23 02:35:13,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:13,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-23 02:35:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2024-11-23 02:35:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2024-11-23 02:35:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.32) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-11-23 02:35:13,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-23 02:35:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 02:35:13,084 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-23 02:35:13,084 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:35:13,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 66 transitions. [2024-11-23 02:35:13,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2024-11-23 02:35:13,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:13,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:13,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:13,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:13,085 INFO L745 eck$LassoCheckResult]: Stem: 997#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 982#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 971#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 972#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 994#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 995#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 996#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1000#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1001#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1013#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1012#L20-4 main_~j~0#1 := 1; 1011#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1009#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1006#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 967#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 968#L25-6 [2024-11-23 02:35:13,085 INFO L747 eck$LassoCheckResult]: Loop: 968#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 983#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 984#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 993#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1003#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1002#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 968#L25-6 [2024-11-23 02:35:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1530158845, now seen corresponding path program 2 times [2024-11-23 02:35:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558267790] [2024-11-23 02:35:13,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:13,116 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:35:13,117 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:13,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:13,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1749769138, now seen corresponding path program 5 times [2024-11-23 02:35:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298161316] [2024-11-23 02:35:13,137 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:35:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:13,145 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:35:13,148 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:13,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:13,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:13,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1481430602, now seen corresponding path program 3 times [2024-11-23 02:35:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:13,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208666749] [2024-11-23 02:35:13,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:35:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:13,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 02:35:13,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:13,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:13,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:13,709 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:35:13,710 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:35:13,710 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:35:13,710 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:35:13,710 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:35:13,710 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:13,710 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:35:13,710 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:35:13,710 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration9_Lasso [2024-11-23 02:35:13,710 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:35:13,710 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:35:13,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:13,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:14,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:14,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:14,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:14,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:14,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:14,385 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:35:14,386 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:35:14,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,388 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-23 02:35:14,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,413 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-23 02:35:14,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,445 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-23 02:35:14,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-11-23 02:35:14,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,466 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-23 02:35:14,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,486 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 02:35:14,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,508 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-23 02:35:14,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-23 02:35:14,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,529 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-23 02:35:14,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-23 02:35:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,551 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-23 02:35:14,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-23 02:35:14,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,571 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-23 02:35:14,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,592 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-23 02:35:14,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,618 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-23 02:35:14,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,643 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-23 02:35:14,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,667 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-23 02:35:14,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,693 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-11-23 02:35:14,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,694 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-23 02:35:14,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,719 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-23 02:35:14,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-23 02:35:14,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,742 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-23 02:35:14,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:14,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,765 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-23 02:35:14,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-11-23 02:35:14,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:14,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:14,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:14,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:14,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,787 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-23 02:35:14,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-11-23 02:35:14,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:14,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:14,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:14,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:14,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:14,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:14,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:35:14,835 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-23 02:35:14,835 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-23 02:35:14,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:14,838 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:14,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-23 02:35:14,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:35:14,851 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:35:14,851 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:35:14,851 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_3) = -1*ULTIMATE.start_main_~#v~0#1.offset - 4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_3 Supporting invariants [] [2024-11-23 02:35:14,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:14,876 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-23 02:35:14,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-23 02:35:14,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:35:14,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:35:14,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:14,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:35:14,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:14,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-23 02:35:14,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:14,989 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-23 02:35:14,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 21 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:15,067 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 66 transitions. cyclomatic complexity: 21. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 94 states and 126 transitions. Complement of second has 11 states. [2024-11-23 02:35:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2024-11-23 02:35:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2024-11-23 02:35:15,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-23 02:35:15,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:15,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 21 letters. Loop has 6 letters. [2024-11-23 02:35:15,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:15,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 44 transitions. Stem has 15 letters. Loop has 12 letters. [2024-11-23 02:35:15,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:15,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 126 transitions. [2024-11-23 02:35:15,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-23 02:35:15,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 92 states and 124 transitions. [2024-11-23 02:35:15,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-23 02:35:15,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-23 02:35:15,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 124 transitions. [2024-11-23 02:35:15,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:15,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 124 transitions. [2024-11-23 02:35:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 124 transitions. [2024-11-23 02:35:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2024-11-23 02:35:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 65 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-11-23 02:35:15,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-23 02:35:15,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-23 02:35:15,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:35:15,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 90 transitions. [2024-11-23 02:35:15,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-23 02:35:15,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:15,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:15,077 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:15,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:35:15,077 INFO L745 eck$LassoCheckResult]: Stem: 1283#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 1266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1255#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 1256#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1278#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1279#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1280#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1292#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1291#L20-4 main_~j~0#1 := 1; 1284#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1267#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1253#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1249#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1250#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1262#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1263#L22-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1260#L22-4 main_~k~0#1 := 1; 1261#L32-3 [2024-11-23 02:35:15,077 INFO L747 eck$LassoCheckResult]: Loop: 1261#L32-3 assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem12#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem13#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem12#1 <= main_#t~mem13#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1274#L6 assume !(0 == __VERIFIER_assert_~cond#1); 1247#L6-2 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 1248#L32-2 main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; 1261#L32-3 [2024-11-23 02:35:15,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:15,078 INFO L85 PathProgramCache]: Analyzing trace with hash 67745056, now seen corresponding path program 1 times [2024-11-23 02:35:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:15,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808033311] [2024-11-23 02:35:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:15,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:15,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:15,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 3087436, now seen corresponding path program 2 times [2024-11-23 02:35:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:15,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762406115] [2024-11-23 02:35:15,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:15,101 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:35:15,101 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:15,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:15,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:15,112 INFO L85 PathProgramCache]: Analyzing trace with hash -804574741, now seen corresponding path program 1 times [2024-11-23 02:35:15,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:15,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311395915] [2024-11-23 02:35:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:15,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:15,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:15,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-23 02:35:16,315 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:35:16,315 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:35:16,315 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:35:16,315 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:35:16,315 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:35:16,315 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,315 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:35:16,316 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:35:16,316 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration10_Lasso [2024-11-23 02:35:16,316 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:35:16,316 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:35:16,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:16,825 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:35:16,825 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:35:16,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:16,828 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:16,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-23 02:35:16,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:16,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:16,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:16,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:16,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:16,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:16,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:16,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:16,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:16,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-23 02:35:16,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:16,848 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:16,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-23 02:35:16,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:16,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:16,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:16,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:16,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:16,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:16,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:16,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:16,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:16,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:16,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:16,867 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:16,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-23 02:35:16,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:16,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:16,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:16,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:16,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:16,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:16,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:16,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:16,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:16,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:16,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:16,888 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:16,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-23 02:35:16,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:16,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:16,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:16,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:16,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:16,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:16,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:16,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:16,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:16,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-23 02:35:16,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:16,908 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:16,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-23 02:35:16,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:16,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:16,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:16,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:16,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:16,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:16,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:16,934 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:35:16,949 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-23 02:35:16,949 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-23 02:35:16,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:16,951 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:16,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-23 02:35:16,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:35:16,965 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:35:16,965 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:35:16,965 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~k~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4) = -1*ULTIMATE.start_main_~#v~0#1.offset - 4*ULTIMATE.start_main_~k~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4 Supporting invariants [] [2024-11-23 02:35:16,973 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-11-23 02:35:16,983 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-23 02:35:17,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-23 02:35:17,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:35:17,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:35:17,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-23 02:35:17,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:17,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:35:17,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:17,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:35:17,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:17,077 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:35:17,077 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 90 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:17,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 90 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 95 transitions. Complement of second has 4 states. [2024-11-23 02:35:17,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-11-23 02:35:17,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-23 02:35:17,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:17,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-23 02:35:17,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:17,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 17 letters. Loop has 8 letters. [2024-11-23 02:35:17,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:17,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2024-11-23 02:35:17,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-23 02:35:17,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 46 states and 61 transitions. [2024-11-23 02:35:17,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-23 02:35:17,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-23 02:35:17,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 61 transitions. [2024-11-23 02:35:17,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:17,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-23 02:35:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 61 transitions. [2024-11-23 02:35:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-23 02:35:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-11-23 02:35:17,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-23 02:35:17,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-11-23 02:35:17,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:35:17,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 61 transitions. [2024-11-23 02:35:17,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-23 02:35:17,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:17,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:17,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:17,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-23 02:35:17,094 INFO L745 eck$LassoCheckResult]: Stem: 1515#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 1498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1489#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 1490#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1512#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1513#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1514#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1522#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 1519#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1518#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1507#L20-4 main_~j~0#1 := 1; 1508#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1526#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1525#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1523#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1509#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1501#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1502#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 1516#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1527#L25-1 [2024-11-23 02:35:17,094 INFO L747 eck$LassoCheckResult]: Loop: 1527#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 1485#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1486#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1529#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 1528#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 1527#L25-1 [2024-11-23 02:35:17,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:17,094 INFO L85 PathProgramCache]: Analyzing trace with hash -606279004, now seen corresponding path program 4 times [2024-11-23 02:35:17,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:17,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416462376] [2024-11-23 02:35:17,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:35:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:17,104 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:35:17,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:17,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:17,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:17,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash 64187797, now seen corresponding path program 2 times [2024-11-23 02:35:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:17,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381325405] [2024-11-23 02:35:17,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:17,122 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:35:17,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:17,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:17,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:17,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1784762158, now seen corresponding path program 1 times [2024-11-23 02:35:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846020282] [2024-11-23 02:35:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:17,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:17,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:17,834 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:35:17,834 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:35:17,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:35:17,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:35:17,834 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:35:17,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:17,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:35:17,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:35:17,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration11_Lasso [2024-11-23 02:35:17,834 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:35:17,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:35:17,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:17,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:17,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:17,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:17,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:17,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:17,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:18,429 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:35:18,429 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:35:18,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,431 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-23 02:35:18,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:18,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:18,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,453 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-23 02:35:18,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:18,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:18,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,475 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-23 02:35:18,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:18,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:18,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:18,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,496 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-23 02:35:18,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:18,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:18,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:18,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,517 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-23 02:35:18,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:18,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:18,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:18,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,538 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-23 02:35:18,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:18,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:18,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,560 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-23 02:35:18,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:18,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:18,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:18,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,580 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-23 02:35:18,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:18,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:18,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-23 02:35:18,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,603 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-23 02:35:18,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:18,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:18,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:18,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:18,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-23 02:35:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,625 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-23 02:35:18,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:18,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:18,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:18,637 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:35:18,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:18,645 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-23 02:35:18,645 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-23 02:35:18,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:35:18,706 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-11-23 02:35:18,706 INFO L444 ModelExtractionUtils]: 12 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-23 02:35:18,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:18,708 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:18,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-23 02:35:18,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:35:18,720 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-23 02:35:18,721 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:35:18,721 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~#v~0#1.offset + 4*ULTIMATE.start_main_~i~0#1 + 2 Supporting invariants [] [2024-11-23 02:35:18,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:18,734 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-23 02:35:18,736 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-23 02:35:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:18,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:35:18,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:18,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:35:18,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:18,820 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:35:18,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:18,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 90 transitions. Complement of second has 7 states. [2024-11-23 02:35:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-23 02:35:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-23 02:35:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:18,848 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:35:18,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:18,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:35:18,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:18,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:35:18,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:18,935 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:35:18,935 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:18,968 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 99 transitions. Complement of second has 9 states. [2024-11-23 02:35:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2024-11-23 02:35:18,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-23 02:35:18,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:18,971 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:35:18,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:19,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:35:19,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:19,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:35:19,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:19,063 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:35:19,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:19,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 61 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 121 states and 175 transitions. Complement of second has 9 states. [2024-11-23 02:35:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2024-11-23 02:35:19,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 5 letters. [2024-11-23 02:35:19,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:19,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 24 letters. Loop has 5 letters. [2024-11-23 02:35:19,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:19,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 19 letters. Loop has 10 letters. [2024-11-23 02:35:19,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:19,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 175 transitions. [2024-11-23 02:35:19,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2024-11-23 02:35:19,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 101 states and 139 transitions. [2024-11-23 02:35:19,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-23 02:35:19,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-23 02:35:19,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 139 transitions. [2024-11-23 02:35:19,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:19,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 139 transitions. [2024-11-23 02:35:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 139 transitions. [2024-11-23 02:35:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2024-11-23 02:35:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 86 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-23 02:35:19,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-23 02:35:19,099 INFO L425 stractBuchiCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-23 02:35:19,099 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-23 02:35:19,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 121 transitions. [2024-11-23 02:35:19,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-23 02:35:19,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:19,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:19,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:19,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:19,103 INFO L745 eck$LassoCheckResult]: Stem: 2108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 2089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2083#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 2084#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2104#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2105#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2106#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2107#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2112#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2111#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2098#L20-4 main_~j~0#1 := 1; 2099#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2115#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2116#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2146#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2142#L26 assume !(main_~i~0#1 < 2); 2138#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 2139#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2080#L25-1 assume !main_#t~short9#1; 2076#L25-3 [2024-11-23 02:35:19,103 INFO L747 eck$LassoCheckResult]: Loop: 2076#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2077#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2090#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2091#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2109#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2134#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2076#L25-3 [2024-11-23 02:35:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash -604616314, now seen corresponding path program 1 times [2024-11-23 02:35:19,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255978014] [2024-11-23 02:35:19,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 02:35:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255978014] [2024-11-23 02:35:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255978014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:35:19,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:35:19,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:35:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193194594] [2024-11-23 02:35:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:35:19,136 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:35:19,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 6 times [2024-11-23 02:35:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:19,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729029068] [2024-11-23 02:35:19,137 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:35:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:19,144 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:35:19,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:19,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:35:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:35:19,296 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. cyclomatic complexity: 41 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:19,320 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2024-11-23 02:35:19,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 117 transitions. [2024-11-23 02:35:19,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-23 02:35:19,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 84 states and 114 transitions. [2024-11-23 02:35:19,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-23 02:35:19,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-23 02:35:19,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 114 transitions. [2024-11-23 02:35:19,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:19,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 114 transitions. [2024-11-23 02:35:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 114 transitions. [2024-11-23 02:35:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-23 02:35:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 77 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-23 02:35:19,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-23 02:35:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:35:19,329 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-23 02:35:19,330 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-23 02:35:19,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 108 transitions. [2024-11-23 02:35:19,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-11-23 02:35:19,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:19,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:19,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:19,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:19,331 INFO L745 eck$LassoCheckResult]: Stem: 2290#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 2276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2267#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 2268#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2287#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2288#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2289#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2296#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2294#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2293#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2277#L20-4 main_~j~0#1 := 1; 2278#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2304#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2305#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2325#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2323#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2322#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 2320#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2263#L25-1 assume !main_#t~short9#1; 2264#L25-3 [2024-11-23 02:35:19,331 INFO L747 eck$LassoCheckResult]: Loop: 2264#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2297#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2272#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2273#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2291#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2336#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2264#L25-3 [2024-11-23 02:35:19,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -604675896, now seen corresponding path program 1 times [2024-11-23 02:35:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511659629] [2024-11-23 02:35:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 7 times [2024-11-23 02:35:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759374700] [2024-11-23 02:35:19,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:35:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1188823131, now seen corresponding path program 1 times [2024-11-23 02:35:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098289518] [2024-11-23 02:35:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:35:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:19,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-23 02:35:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:19,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:20,029 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:35:20,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:35:20,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:35:20,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:35:20,029 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:35:20,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:35:20,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:35:20,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1-2.c_Iteration13_Lasso [2024-11-23 02:35:20,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:35:20,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:35:20,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:35:20,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:35:20,680 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:35:20,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,682 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-23 02:35:20,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:20,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:20,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:20,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-23 02:35:20,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,703 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-23 02:35:20,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:20,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:20,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:20,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-23 02:35:20,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,723 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-23 02:35:20,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:20,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:20,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:20,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:20,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,743 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-23 02:35:20,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:20,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:20,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-23 02:35:20,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,768 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-23 02:35:20,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:20,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:20,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:20,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,789 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-23 02:35:20,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-11-23 02:35:20,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:35:20,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:35:20,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:35:20,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:20,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,810 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-23 02:35:20,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,822 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:35:20,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,830 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-23 02:35:20,830 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-23 02:35:20,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-23 02:35:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,852 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-23 02:35:20,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:20,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:20,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:35:20,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:20,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,875 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-23 02:35:20,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:35:20,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:35:20,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:35:20,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:35:20,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:35:20,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:35:20,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:35:20,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:35:20,917 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-23 02:35:20,917 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-23 02:35:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:35:20,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:20,919 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:35:20,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-23 02:35:20,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:35:20,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:35:20,933 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:35:20,933 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_6, ULTIMATE.start_main_~#v~0#1.offset, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_6 - 1*ULTIMATE.start_main_~#v~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-11-23 02:35:20,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:20,952 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-23 02:35:20,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#v~0!offset [2024-11-23 02:35:20,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:35:20,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:35:20,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:20,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:35:20,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:35:21,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:35:21,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:35:21,043 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-23 02:35:21,043 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 108 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:21,063 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 108 transitions. cyclomatic complexity: 36. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 205 states and 307 transitions. Complement of second has 6 states. [2024-11-23 02:35:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:35:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-23 02:35:21,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 6 letters. [2024-11-23 02:35:21,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:21,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 25 letters. Loop has 6 letters. [2024-11-23 02:35:21,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:21,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 19 letters. Loop has 12 letters. [2024-11-23 02:35:21,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:35:21,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 307 transitions. [2024-11-23 02:35:21,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2024-11-23 02:35:21,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 150 states and 219 transitions. [2024-11-23 02:35:21,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-23 02:35:21,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-23 02:35:21,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 219 transitions. [2024-11-23 02:35:21,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:35:21,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-11-23 02:35:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 219 transitions. [2024-11-23 02:35:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 110. [2024-11-23 02:35:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 109 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-23 02:35:21,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-23 02:35:21,072 INFO L425 stractBuchiCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-23 02:35:21,072 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-23 02:35:21,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 161 transitions. [2024-11-23 02:35:21,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-23 02:35:21,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:35:21,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:35:21,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:35:21,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:35:21,073 INFO L745 eck$LassoCheckResult]: Stem: 2697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); 2680#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~post14#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;havoc main_#t~nondet4#1;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2676#L15 assume !((if main_~SIZE~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then main_~SIZE~0#1 % 4294967296 % 18446744073709551616 else main_~SIZE~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616) >= 1000000000);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * main_~SIZE~0#1 % 4294967296);main_~j~0#1 := 0; 2677#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2693#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2694#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2695#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2696#L20-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4); 2703#L20-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2702#L20-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2688#L20-4 main_~j~0#1 := 1; 2689#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2708#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2709#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2719#L25-3 assume !!main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2716#L26 assume main_~i~0#1 < 2;call main_#t~mem10#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int#1(main_#t~mem10#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2717#L26-2 main_~i~0#1 := main_~i~0#1 - 1; 2710#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2712#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2701#L25-3 [2024-11-23 02:35:21,073 INFO L747 eck$LassoCheckResult]: Loop: 2701#L25-3 assume !main_#t~short9#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2700#L25-6 call write~int#1(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2681#L22-2 main_#t~post11#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2682#L22-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem7#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;main_~i~0#1 := main_~j~0#1 - 1; 2698#L25-5 main_#t~short9#1 := main_~i~0#1 >= 0; 2713#L25-1 assume main_#t~short9#1;call main_#t~mem8#1 := read~int#1(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > main_~key~0#1; 2701#L25-3 [2024-11-23 02:35:21,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash -604675898, now seen corresponding path program 2 times [2024-11-23 02:35:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833965413] [2024-11-23 02:35:21,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:21,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:35:21,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:35:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 02:35:21,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:35:21,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833965413] [2024-11-23 02:35:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833965413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:35:21,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971519849] [2024-11-23 02:35:21,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:35:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:35:21,131 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:35:21,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2024-11-23 02:35:21,180 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:35:21,180 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:35:21,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 02:35:21,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:35:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 02:35:21,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:35:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 02:35:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971519849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:35:21,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:35:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-23 02:35:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016203680] [2024-11-23 02:35:21,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:35:21,214 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:35:21,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:35:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2122936108, now seen corresponding path program 8 times [2024-11-23 02:35:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:35:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341448182] [2024-11-23 02:35:21,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:35:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:35:21,217 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:35:21,218 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:35:21,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:35:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:35:21,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:35:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:35:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:35:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:35:21,351 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. cyclomatic complexity: 60 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:35:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:35:21,403 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-11-23 02:35:21,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 87 transitions. [2024-11-23 02:35:21,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:35:21,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2024-11-23 02:35:21,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:35:21,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:35:21,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:35:21,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:35:21,404 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:35:21,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:35:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 02:35:21,405 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:35:21,405 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-23 02:35:21,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:35:21,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:35:21,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:35:21,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:35:21 BoogieIcfgContainer [2024-11-23 02:35:21,410 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:35:21,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:35:21,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:35:21,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:35:21,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:35:07" (3/4) ... [2024-11-23 02:35:21,412 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:35:21,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:35:21,414 INFO L158 Benchmark]: Toolchain (without parser) took 14561.10ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 80.2MB in the beginning and 130.9MB in the end (delta: -50.7MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.05ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 67.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.55ms. Allocated memory is still 155.2MB. Free memory was 67.6MB in the beginning and 65.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: Boogie Preprocessor took 34.92ms. Allocated memory is still 155.2MB. Free memory was 65.9MB in the beginning and 63.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: RCFGBuilder took 423.65ms. Allocated memory is still 155.2MB. Free memory was 63.8MB in the beginning and 119.6MB in the end (delta: -55.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: BuchiAutomizer took 13843.08ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 119.0MB in the beginning and 131.9MB in the end (delta: -12.9MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2024-11-23 02:35:21,414 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 299.9MB. Free memory was 131.9MB in the beginning and 130.9MB in the end (delta: 984.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:35:21,415 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.11ms. Allocated memory is still 155.2MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.05ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 67.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.55ms. Allocated memory is still 155.2MB. Free memory was 67.6MB in the beginning and 65.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.92ms. Allocated memory is still 155.2MB. Free memory was 65.9MB in the beginning and 63.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.65ms. Allocated memory is still 155.2MB. Free memory was 63.8MB in the beginning and 119.6MB in the end (delta: -55.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 13843.08ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 119.0MB in the beginning and 131.9MB in the end (delta: -12.9MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 299.9MB. Free memory was 131.9MB in the beginning and 130.9MB in the end (delta: 984.8kB). 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 13.7s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 12.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 740 SdHoareTripleChecker+Invalid, 0.3s 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: 96ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-23 02:35:21,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:21,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:21,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-23 02:35:22,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:22,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-23 02:35:22,431 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