./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:09:56,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:09:56,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:09:56,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:09:56,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:09:56,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:09:56,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:09:56,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:09:56,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:09:56,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:09:56,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:09:56,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:09:56,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:09:56,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:09:56,766 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:09:56,766 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:09:56,768 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:09:56,769 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:09:56,769 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:09:56,769 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:09:56,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:09:56,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:09:56,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:09:56,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:09:56,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:09:56,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:09:56,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:09:56,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:09:56,774 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:09:56,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:09:56,775 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:09:56,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:09:56,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:09:56,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:09:56,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:09:56,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:09:56,777 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:09:56,777 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a [2024-11-17 08:09:57,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:09:57,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:09:57,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:09:57,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:09:57,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:09:57,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-11-17 08:09:58,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:09:58,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:09:58,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-11-17 08:09:58,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed2a3247/3c5ee2695a0e449c816d11417017e5d9/FLAG0ffb8f58d [2024-11-17 08:09:58,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed2a3247/3c5ee2695a0e449c816d11417017e5d9 [2024-11-17 08:09:58,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:09:58,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:09:58,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:09:58,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:09:58,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:09:58,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:09:58" (1/1) ... [2024-11-17 08:09:58,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1127a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:58, skipping insertion in model container [2024-11-17 08:09:58,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:09:58" (1/1) ... [2024-11-17 08:09:58,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:09:59,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:09:59,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:09:59,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:09:59,235 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:09:59,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59 WrapperNode [2024-11-17 08:09:59,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:09:59,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:09:59,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:09:59,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:09:59,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,289 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-11-17 08:09:59,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:09:59,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:09:59,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:09:59,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:09:59,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,330 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-17 08:09:59,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:09:59,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:09:59,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:09:59,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:09:59,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (1/1) ... [2024-11-17 08:09:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:09:59,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:09:59,380 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-17 08:09:59,383 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-17 08:09:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:09:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:09:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:09:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:09:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:09:59,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:09:59,508 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:09:59,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:09:59,619 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: call ULTIMATE.dealloc(main_#t~malloc206#1.base, main_#t~malloc206#1.offset);havoc main_#t~malloc206#1.base, main_#t~malloc206#1.offset; [2024-11-17 08:09:59,625 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-17 08:09:59,626 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:09:59,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:09:59,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:09:59,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:09:59 BoogieIcfgContainer [2024-11-17 08:09:59,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:09:59,643 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:09:59,643 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:09:59,647 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:09:59,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:09:59,649 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:09:58" (1/3) ... [2024-11-17 08:09:59,650 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@699fd7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:09:59, skipping insertion in model container [2024-11-17 08:09:59,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:09:59,650 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:09:59" (2/3) ... [2024-11-17 08:09:59,651 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@699fd7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:09:59, skipping insertion in model container [2024-11-17 08:09:59,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:09:59,651 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:09:59" (3/3) ... [2024-11-17 08:09:59,652 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2024-11-17 08:09:59,703 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:09:59,703 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:09:59,704 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:09:59,704 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:09:59,704 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:09:59,705 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:09:59,705 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:09:59,705 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:09:59,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:59,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-17 08:09:59,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:59,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:59,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:09:59,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:09:59,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:09:59,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:09:59,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-11-17 08:09:59,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:09:59,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:09:59,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:09:59,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:09:59,745 INFO L745 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 7#L368-1true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 15#L369-1true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 12#L371true [2024-11-17 08:09:59,746 INFO L747 eck$LassoCheckResult]: Loop: 12#L371true assume true; 9#L371-1true assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 12#L371true [2024-11-17 08:09:59,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 58180764, now seen corresponding path program 1 times [2024-11-17 08:09:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:59,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033628745] [2024-11-17 08:09:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:59,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:09:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:59,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:09:59,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1600, now seen corresponding path program 1 times [2024-11-17 08:09:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:59,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455276807] [2024-11-17 08:09:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:09:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:59,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:09:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:09:59,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:09:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:09:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash 77139995, now seen corresponding path program 1 times [2024-11-17 08:09:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:09:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016862474] [2024-11-17 08:09:59,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:09:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:00,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:00,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:00,434 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:10:00,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:10:00,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:10:00,435 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:10:00,435 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:10:00,435 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:00,435 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:10:00,435 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:10:00,435 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2024-11-17 08:10:00,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:10:00,436 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:10:00,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:00,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,105 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:10:01,109 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:10:01,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:01,114 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-17 08:10:01,116 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-17 08:10:01,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:01,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:01,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:01,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:01,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:01,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:01,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:01,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:01,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:01,153 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-17 08:10:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:01,156 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-17 08:10:01,157 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-17 08:10:01,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:01,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:01,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:01,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:01,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:01,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:01,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:01,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:01,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:01,192 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-17 08:10:01,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:01,195 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-17 08:10:01,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:01,201 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-17 08:10:01,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:01,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:01,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:01,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:01,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:01,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:01,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:01,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:01,230 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-17 08:10:01,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:01,233 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-17 08:10:01,235 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-17 08:10:01,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:01,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:01,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:01,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:01,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:01,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:01,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:01,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:01,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:01,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:01,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:01,265 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-17 08:10:01,266 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-17 08:10:01,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:01,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:01,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:01,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:01,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:01,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:01,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:01,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:10:01,331 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:10:01,331 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:10:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:01,339 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-17 08:10:01,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:10:01,348 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-17 08:10:01,360 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:10:01,360 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:10:01,361 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-17 08:10:01,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:10:01,395 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-17 08:10:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:01,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:10:01,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:01,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:10:01,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:01,475 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-17 08:10:01,508 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:10:01,510 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:01,545 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 43 transitions. Complement of second has 6 states. [2024-11-17 08:10:01,549 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-17 08:10:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-17 08:10:01,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-17 08:10:01,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-17 08:10:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-17 08:10:01,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:01,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2024-11-17 08:10:01,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:10:01,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 15 states and 20 transitions. [2024-11-17 08:10:01,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:01,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:10:01,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-11-17 08:10:01,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:01,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-17 08:10:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-11-17 08:10:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 08:10:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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-17 08:10:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-11-17 08:10:01,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-17 08:10:01,589 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-17 08:10:01,589 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:10:01,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-11-17 08:10:01,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:10:01,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:01,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:01,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:01,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:10:01,591 INFO L745 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 116#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 119#L367 assume !(main_~length~0#1 < 1); 117#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 118#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 126#L371 assume true; 120#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 121#L374-3 main_~j~0#1 := 0; 127#L374 [2024-11-17 08:10:01,591 INFO L747 eck$LassoCheckResult]: Loop: 127#L374 assume true; 113#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 114#L375 assume !true; 125#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 127#L374 [2024-11-17 08:10:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1903627498, now seen corresponding path program 1 times [2024-11-17 08:10:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:01,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265147806] [2024-11-17 08:10:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:01,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:01,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1322650, now seen corresponding path program 1 times [2024-11-17 08:10:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:01,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634074178] [2024-11-17 08:10:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:01,660 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-17 08:10:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634074178] [2024-11-17 08:10:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634074178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:10:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:10:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:10:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937793236] [2024-11-17 08:10:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:10:01,665 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:10:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:10:01,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:10:01,669 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 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-17 08:10:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:01,674 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-11-17 08:10:01,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-11-17 08:10:01,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:10:01,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2024-11-17 08:10:01,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:10:01,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:10:01,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-17 08:10:01,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:01,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-17 08:10:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-17 08:10:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 08:10:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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-17 08:10:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-17 08:10:01,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-17 08:10:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:10:01,680 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-17 08:10:01,681 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:10:01,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-17 08:10:01,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:10:01,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:01,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:01,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:01,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:10:01,685 INFO L745 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 152#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 153#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 160#L371 assume true; 155#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 156#L374-3 main_~j~0#1 := 0; 162#L374 [2024-11-17 08:10:01,685 INFO L747 eck$LassoCheckResult]: Loop: 162#L374 assume true; 148#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 149#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 159#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 161#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 162#L374 [2024-11-17 08:10:01,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1903627498, now seen corresponding path program 2 times [2024-11-17 08:10:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206391114] [2024-11-17 08:10:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:01,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash 41001255, now seen corresponding path program 1 times [2024-11-17 08:10:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214247896] [2024-11-17 08:10:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:01,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash 375280434, now seen corresponding path program 1 times [2024-11-17 08:10:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:01,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809714289] [2024-11-17 08:10:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:01,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:01,975 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:10:01,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:10:01,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:10:01,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:10:01,976 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:10:01,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:01,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:10:01,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:10:01,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2024-11-17 08:10:01,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:10:01,977 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:10:01,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:01,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:02,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:02,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:02,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:02,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:02,288 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:10:02,289 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:10:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,293 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-17 08:10:02,295 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-17 08:10:02,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:02,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,326 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-17 08:10:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,329 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-17 08:10:02,330 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-17 08:10:02,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:02,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,358 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-17 08:10:02,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,360 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-17 08:10:02,361 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-17 08:10:02,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,386 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-17 08:10:02,387 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-17 08:10:02,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:02,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,415 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/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-17 08:10:02,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:10:02,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:02,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:10:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/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-17 08:10:02,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:10:02,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:10:02,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,479 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-17 08:10:02,480 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-17 08:10:02,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:10:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,505 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-17 08:10:02,506 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-17 08:10:02,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,528 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-17 08:10:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,529 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-17 08:10:02,530 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-17 08:10:02,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,554 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-17 08:10:02,555 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-17 08:10:02,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:02,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:02,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:02,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,578 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-17 08:10:02,579 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-17 08:10:02,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:02,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:02,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:10:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,613 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-17 08:10:02,615 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-17 08:10:02,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:02,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:02,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,678 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-17 08:10:02,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,681 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-17 08:10:02,684 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-17 08:10:02,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:02,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:02,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,717 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-17 08:10:02,717 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-17 08:10:02,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:02,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:02,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:02,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:02,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,750 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-17 08:10:02,751 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-17 08:10:02,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:02,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:02,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:02,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:02,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:02,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:02,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:02,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:10:02,804 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-17 08:10:02,804 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-17 08:10:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:02,806 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-17 08:10:02,807 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-17 08:10:02,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:10:02,824 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:10:02,824 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:10:02,824 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2024-11-17 08:10:02,839 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-17 08:10:02,851 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-17 08:10:02,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:10:02,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:10:02,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:02,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:10:02,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:02,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:10:02,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:02,984 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-17 08:10:02,986 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-17 08:10:02,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 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-17 08:10:03,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. 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) Result 22 states and 28 transitions. Complement of second has 7 states. [2024-11-17 08:10:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. 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-17 08:10:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2024-11-17 08:10:03,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 5 letters. [2024-11-17 08:10:03,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:03,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 5 letters. [2024-11-17 08:10:03,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:03,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 10 letters. [2024-11-17 08:10:03,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:03,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2024-11-17 08:10:03,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:03,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2024-11-17 08:10:03,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:03,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:10:03,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-11-17 08:10:03,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:03,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-17 08:10:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-11-17 08:10:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-17 08:10:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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-17 08:10:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-17 08:10:03,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-17 08:10:03,038 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-17 08:10:03,039 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:10:03,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2024-11-17 08:10:03,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:03,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:03,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:03,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:03,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:03,040 INFO L745 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 274#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 277#L367 assume !(main_~length~0#1 < 1); 275#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 276#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 284#L371 assume true; 278#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 279#L374-3 main_~j~0#1 := 0; 287#L374 assume true; 269#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 270#L375 [2024-11-17 08:10:03,040 INFO L747 eck$LassoCheckResult]: Loop: 270#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 282#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 270#L375 [2024-11-17 08:10:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash 270042933, now seen corresponding path program 1 times [2024-11-17 08:10:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722274016] [2024-11-17 08:10:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:03,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2024-11-17 08:10:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836729820] [2024-11-17 08:10:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1813221140, now seen corresponding path program 1 times [2024-11-17 08:10:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600610611] [2024-11-17 08:10:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:03,349 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-17 08:10:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:03,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600610611] [2024-11-17 08:10:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600610611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:10:03,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:10:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:10:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300492781] [2024-11-17 08:10:03,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:10:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 08:10:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 08:10:03,388 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-17 08:10:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:03,432 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-17 08:10:03,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-11-17 08:10:03,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:03,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 38 transitions. [2024-11-17 08:10:03,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-17 08:10:03,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-17 08:10:03,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2024-11-17 08:10:03,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:03,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-17 08:10:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2024-11-17 08:10:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2024-11-17 08:10:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-17 08:10:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-17 08:10:03,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-17 08:10:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:10:03,442 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-17 08:10:03,442 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:10:03,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-17 08:10:03,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:03,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:03,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:03,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:03,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:03,443 INFO L745 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 340#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 343#L367 assume !(main_~length~0#1 < 1); 341#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 342#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 350#L371 assume true; 344#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 345#L374-3 main_~j~0#1 := 0; 354#L374 assume true; 355#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 356#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 351#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 352#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 353#L374 assume true; 335#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 336#L375 [2024-11-17 08:10:03,443 INFO L747 eck$LassoCheckResult]: Loop: 336#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 348#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 336#L375 [2024-11-17 08:10:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash -132755375, now seen corresponding path program 2 times [2024-11-17 08:10:03,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011589151] [2024-11-17 08:10:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011589151] [2024-11-17 08:10:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011589151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501835671] [2024-11-17 08:10:03,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:10:03,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:03,513 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-17 08:10:03,515 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-17 08:10:03,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:10:03,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:03,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:10:03,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:03,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:10:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501835671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:10:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:10:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 08:10:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766113411] [2024-11-17 08:10:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:10:03,631 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:03,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2024-11-17 08:10:03,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938169622] [2024-11-17 08:10:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:03,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 08:10:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:10:03,676 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-17 08:10:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:03,706 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-17 08:10:03,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-11-17 08:10:03,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:03,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 23 states and 26 transitions. [2024-11-17 08:10:03,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:03,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:10:03,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2024-11-17 08:10:03,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:03,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-17 08:10:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2024-11-17 08:10:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-17 08:10:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 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-17 08:10:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-17 08:10:03,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-17 08:10:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:10:03,711 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-17 08:10:03,711 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:10:03,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2024-11-17 08:10:03,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:03,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:03,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:03,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:03,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:03,713 INFO L745 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 456#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 459#L367 assume !(main_~length~0#1 < 1); 457#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 458#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 466#L371 assume true; 462#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 463#L371 assume true; 460#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 461#L374-3 main_~j~0#1 := 0; 470#L374 assume true; 471#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 472#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 467#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 468#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 469#L374 assume true; 451#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 452#L375 [2024-11-17 08:10:03,713 INFO L747 eck$LassoCheckResult]: Loop: 452#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 464#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 452#L375 [2024-11-17 08:10:03,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1580562160, now seen corresponding path program 1 times [2024-11-17 08:10:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365174712] [2024-11-17 08:10:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:03,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2024-11-17 08:10:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296833951] [2024-11-17 08:10:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:03,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:03,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1498187311, now seen corresponding path program 1 times [2024-11-17 08:10:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639083447] [2024-11-17 08:10:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:03,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:03,977 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-17 08:10:04,047 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:10:04,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:10:04,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:10:04,048 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:10:04,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:10:04,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:10:04,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:10:04,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2024-11-17 08:10:04,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:10:04,049 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:10:04,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:04,417 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:10:04,417 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:10:04,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,420 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-17 08:10:04,421 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-17 08:10:04,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:04,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:04,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:04,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:04,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,443 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-17 08:10:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,445 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-17 08:10:04,447 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-17 08:10:04,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:04,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:04,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:04,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:04,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-17 08:10:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,474 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-17 08:10:04,475 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-17 08:10:04,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:04,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:04,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:04,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:04,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-17 08:10:04,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,498 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-17 08:10:04,499 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-17 08:10:04,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:04,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:04,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:04,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,525 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-17 08:10:04,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,527 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-17 08:10:04,527 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-17 08:10:04,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:04,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:04,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:04,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:04,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:10:04,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,552 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-17 08:10:04,553 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-17 08:10:04,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:04,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:04,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:04,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:04,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:04,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,586 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-17 08:10:04,587 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-17 08:10:04,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:04,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:04,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:04,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,622 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-17 08:10:04,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,624 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-17 08:10:04,625 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-17 08:10:04,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:04,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:04,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:04,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:04,658 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-17 08:10:04,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,660 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-17 08:10:04,661 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-17 08:10:04,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:04,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:04,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:04,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:04,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:04,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:04,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:04,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:10:04,690 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:10:04,691 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-17 08:10:04,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:04,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:04,692 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-17 08:10:04,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:10:04,694 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-17 08:10:04,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:10:04,704 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:10:04,704 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2024-11-17 08:10:04,715 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-17 08:10:04,729 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-17 08:10:04,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-17 08:10:04,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-17 08:10:04,730 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-17 08:10:04,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:04,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:04,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:04,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:04,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:04,907 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-17 08:10:04,908 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:10:04,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:04,953 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 25 transitions. Complement of second has 5 states. [2024-11-17 08:10:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-17 08:10:04,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-17 08:10:04,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:04,955 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:10:04,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:04,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:04,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:05,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:05,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:05,145 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-17 08:10:05,145 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:10:05,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:05,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 25 transitions. Complement of second has 5 states. [2024-11-17 08:10:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-17 08:10:05,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-17 08:10:05,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:05,192 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:10:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:05,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:05,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:05,291 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-17 08:10:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:05,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:05,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:05,408 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-17 08:10:05,409 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:10:05,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:05,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 44 transitions. Complement of second has 11 states. [2024-11-17 08:10:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-17 08:10:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2024-11-17 08:10:05,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-17 08:10:05,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:05,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 19 letters. Loop has 2 letters. [2024-11-17 08:10:05,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:05,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 4 letters. [2024-11-17 08:10:05,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:05,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2024-11-17 08:10:05,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:05,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 36 transitions. [2024-11-17 08:10:05,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:10:05,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:10:05,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-11-17 08:10:05,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:05,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-17 08:10:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-11-17 08:10:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-17 08:10:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 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-17 08:10:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-17 08:10:05,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:10:05,529 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:10:05,529 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:10:05,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-11-17 08:10:05,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:05,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:05,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:05,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:05,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:05,531 INFO L745 eck$LassoCheckResult]: Stem: 832#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 833#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 836#L367 assume !(main_~length~0#1 < 1); 834#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 835#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 843#L371 assume true; 839#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 840#L371 assume true; 837#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 838#L374-3 main_~j~0#1 := 0; 848#L374 assume true; 849#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 854#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 853#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 846#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 847#L374 assume true; 850#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 845#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 855#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 852#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 851#L374 assume true; 828#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 829#L375 [2024-11-17 08:10:05,531 INFO L747 eck$LassoCheckResult]: Loop: 829#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 841#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 829#L375 [2024-11-17 08:10:05,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -802013354, now seen corresponding path program 2 times [2024-11-17 08:10:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:05,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71297205] [2024-11-17 08:10:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71297205] [2024-11-17 08:10:05,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71297205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:05,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142150716] [2024-11-17 08:10:05,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:10:05,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:05,615 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:05,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-17 08:10:05,675 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:10:05,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:05,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:10:05,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:05,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:10:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142150716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:10:05,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:10:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-17 08:10:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957642964] [2024-11-17 08:10:05,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:10:05,815 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:05,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2024-11-17 08:10:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:05,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738550558] [2024-11-17 08:10:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:05,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:05,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:05,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 08:10:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-17 08:10:05,865 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 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-17 08:10:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:05,929 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-17 08:10:05,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 52 transitions. [2024-11-17 08:10:05,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:05,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 31 states and 35 transitions. [2024-11-17 08:10:05,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:05,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:10:05,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2024-11-17 08:10:05,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:05,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-17 08:10:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2024-11-17 08:10:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-17 08:10:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 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-17 08:10:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-17 08:10:05,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 08:10:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:10:05,933 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-17 08:10:05,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:10:05,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2024-11-17 08:10:05,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:05,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:05,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:05,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:05,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:05,935 INFO L745 eck$LassoCheckResult]: Stem: 1048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1049#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1052#L367 assume !(main_~length~0#1 < 1); 1050#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1051#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1060#L371 assume true; 1055#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1056#L371 assume true; 1061#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1071#L371 assume true; 1053#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 1054#L374-3 main_~j~0#1 := 0; 1065#L374 assume true; 1066#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1073#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1072#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1063#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1064#L374 assume true; 1046#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1047#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1070#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1069#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1067#L374 assume true; 1044#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1045#L375 [2024-11-17 08:10:05,935 INFO L747 eck$LassoCheckResult]: Loop: 1045#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1057#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1045#L375 [2024-11-17 08:10:05,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:05,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1456439735, now seen corresponding path program 3 times [2024-11-17 08:10:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557343023] [2024-11-17 08:10:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557343023] [2024-11-17 08:10:06,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557343023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007166379] [2024-11-17 08:10:06,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:10:06,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:06,293 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:06,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-17 08:10:06,351 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-17 08:10:06,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:06,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 08:10:06,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:06,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:10:06,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 08:10:06,473 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-17 08:10:06,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 47 [2024-11-17 08:10:06,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:10:06,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 78 [2024-11-17 08:10:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:07,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:10:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007166379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:10:07,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:10:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2024-11-17 08:10:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8935757] [2024-11-17 08:10:07,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:10:07,419 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2024-11-17 08:10:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710543338] [2024-11-17 08:10:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 08:10:07,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2024-11-17 08:10:07,464 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 8 Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-17 08:10:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:07,728 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-17 08:10:07,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2024-11-17 08:10:07,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:07,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 36 transitions. [2024-11-17 08:10:07,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:07,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:10:07,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-11-17 08:10:07,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:07,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-17 08:10:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-11-17 08:10:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-17 08:10:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-17 08:10:07,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-17 08:10:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:10:07,732 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-17 08:10:07,733 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:10:07,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2024-11-17 08:10:07,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:07,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:07,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:07,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:07,734 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:07,734 INFO L745 eck$LassoCheckResult]: Stem: 1288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1289#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1292#L367 assume !(main_~length~0#1 < 1); 1290#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1291#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1300#L371 assume true; 1295#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1296#L371 assume true; 1301#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1312#L371 assume true; 1293#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 1294#L374-3 main_~j~0#1 := 0; 1305#L374 assume true; 1306#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1313#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1311#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1303#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1304#L374 assume true; 1307#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1298#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1299#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1302#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1310#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1309#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1308#L374 assume true; 1284#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1285#L375 [2024-11-17 08:10:07,734 INFO L747 eck$LassoCheckResult]: Loop: 1285#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1297#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1285#L375 [2024-11-17 08:10:07,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash -459093064, now seen corresponding path program 2 times [2024-11-17 08:10:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890219681] [2024-11-17 08:10:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:07,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2024-11-17 08:10:07,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:07,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191251542] [2024-11-17 08:10:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:07,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1193197271, now seen corresponding path program 3 times [2024-11-17 08:10:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:07,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716513641] [2024-11-17 08:10:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:07,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:08,360 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:10:08,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:10:08,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:10:08,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:10:08,360 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:10:08,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,361 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:10:08,361 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:10:08,361 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2024-11-17 08:10:08,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:10:08,361 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:10:08,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:08,813 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:10:08,813 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:10:08,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,815 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-17 08:10:08,817 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-17 08:10:08,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:08,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:08,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:08,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:08,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:08,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:08,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:08,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:08,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:08,846 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-17 08:10:08,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,848 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-17 08:10:08,848 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-17 08:10:08,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-17 08:10:08,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:08,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:08,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:08,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:08,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:08,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:08,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:08,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:08,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-17 08:10:08,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,877 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-17 08:10:08,879 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-17 08:10:08,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:08,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:08,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:08,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:08,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:08,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:08,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:08,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:08,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:08,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,908 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-17 08:10:08,910 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-17 08:10:08,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:08,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:08,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:08,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:08,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:08,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:08,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:08,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:08,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:08,935 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-17 08:10:08,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,937 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-17 08:10:08,937 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-17 08:10: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-17 08:10:08,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:08,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:08,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:08,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:08,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:08,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:08,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:08,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:08,960 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-17 08:10:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,962 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-17 08:10:08,962 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-17 08:10: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-17 08:10:08,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:08,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:08,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:08,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:08,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:08,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:08,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:08,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:08,985 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-17 08:10:08,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:08,987 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-17 08:10:08,988 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-17 08:10: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-17 08:10:09,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:09,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:09,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:09,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:09,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,014 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-17 08:10:09,015 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-17 08:10:09,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:09,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:09,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:09,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:09,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,037 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-17 08:10:09,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,039 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-17 08:10:09,040 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-17 08:10:09,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:09,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:09,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:09,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-17 08:10:09,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,074 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-17 08:10:09,075 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-17 08:10:09,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:09,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:09,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:09,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-17 08:10:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,106 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-17 08:10:09,107 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-17 08:10:09,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:09,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:09,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:09,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,133 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-17 08:10:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,134 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-17 08:10:09,135 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-17 08:10:09,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:09,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:09,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:09,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-17 08:10:09,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,172 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-17 08:10:09,175 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-17 08:10:09,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:09,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:09,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:09,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:09,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,206 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-17 08:10:09,207 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-17 08:10:09,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:09,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:09,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:09,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:09,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:09,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:09,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:09,226 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:10:09,238 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-17 08:10:09,238 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-17 08:10:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:09,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:09,241 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-17 08:10:09,242 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-17 08:10:09,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:10:09,257 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:10:09,257 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:10:09,258 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2024-11-17 08:10:09,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-17 08:10:09,290 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:10:09,292 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-17 08:10:09,292 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-17 08:10:09,292 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-17 08:10:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:10:09,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:09,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:09,446 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-17 08:10:09,447 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-17 08:10:09,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 35 transitions. Complement of second has 4 states. [2024-11-17 08:10:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-17 08:10:09,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 26 letters. Loop has 2 letters. [2024-11-17 08:10:09,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:09,470 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:10:09,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:10:09,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:09,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:09,613 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-17 08:10:09,613 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-17 08:10:09,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 35 transitions. Complement of second has 4 states. [2024-11-17 08:10:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-17 08:10:09,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 26 letters. Loop has 2 letters. [2024-11-17 08:10:09,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:09,641 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:10:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:10:09,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:09,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:09,779 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-17 08:10:09,780 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-17 08:10:09,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 54 transitions. Complement of second has 12 states. [2024-11-17 08:10:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-17 08:10:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2024-11-17 08:10:09,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 26 letters. Loop has 2 letters. [2024-11-17 08:10:09,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:09,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 2 letters. [2024-11-17 08:10:09,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:09,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 26 letters. Loop has 4 letters. [2024-11-17 08:10:09,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:09,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-11-17 08:10:09,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:09,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 46 transitions. [2024-11-17 08:10:09,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:10:09,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:10:09,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2024-11-17 08:10:09,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:09,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-17 08:10:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2024-11-17 08:10:09,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-17 08:10:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:10:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-17 08:10:09,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-17 08:10:09,861 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-17 08:10:09,861 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:10:09,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 42 transitions. [2024-11-17 08:10:09,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:09,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:09,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:09,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:09,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:09,862 INFO L745 eck$LassoCheckResult]: Stem: 1769#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1770#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1773#L367 assume !(main_~length~0#1 < 1); 1771#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1772#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1781#L371 assume true; 1776#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1777#L371 assume true; 1782#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1791#L371 assume true; 1774#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 1775#L374-3 main_~j~0#1 := 0; 1786#L374 assume true; 1787#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1795#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1796#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1801#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1800#L374 assume true; 1799#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1779#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1780#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1785#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1794#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1783#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1784#L374 assume true; 1788#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1797#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1792#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1790#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1789#L374 assume true; 1765#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 1766#L375 [2024-11-17 08:10:09,862 INFO L747 eck$LassoCheckResult]: Loop: 1766#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1778#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1766#L375 [2024-11-17 08:10:09,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1390503342, now seen corresponding path program 4 times [2024-11-17 08:10:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729279515] [2024-11-17 08:10:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:09,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-17 08:10:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:10:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729279515] [2024-11-17 08:10:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729279515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483088343] [2024-11-17 08:10:10,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:10:10,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:10,037 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:10,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-17 08:10:10,094 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:10:10,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:10,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:10,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:10:10,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:10:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:10:10,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483088343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:10:10,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:10:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-11-17 08:10:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978139418] [2024-11-17 08:10:10,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:10:10,296 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2024-11-17 08:10:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519726876] [2024-11-17 08:10:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:10,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:10,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 08:10:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-17 08:10:10,336 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. cyclomatic complexity: 10 Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 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-17 08:10:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:10,387 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-11-17 08:10:10,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 70 transitions. [2024-11-17 08:10:10,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:10,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 45 transitions. [2024-11-17 08:10:10,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:10,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:10:10,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2024-11-17 08:10:10,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:10,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-17 08:10:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2024-11-17 08:10:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-17 08:10:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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-17 08:10:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-17 08:10:10,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-17 08:10:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:10:10,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-17 08:10:10,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:10:10,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2024-11-17 08:10:10,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:10,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:10,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:10,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:10,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:10,393 INFO L745 eck$LassoCheckResult]: Stem: 2068#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2069#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2072#L367 assume !(main_~length~0#1 < 1); 2070#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2071#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2079#L371 assume true; 2080#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2081#L371 assume true; 2075#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2076#L371 assume true; 2092#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2091#L371 assume true; 2073#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 2074#L374-3 main_~j~0#1 := 0; 2085#L374 assume true; 2086#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2102#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2101#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2083#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2084#L374 assume true; 2066#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2067#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2078#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2082#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2100#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2099#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2098#L374 assume true; 2097#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2093#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2090#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2089#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2087#L374 assume true; 2064#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2065#L375 [2024-11-17 08:10:10,393 INFO L747 eck$LassoCheckResult]: Loop: 2065#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2077#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2065#L375 [2024-11-17 08:10:10,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1809989741, now seen corresponding path program 5 times [2024-11-17 08:10:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841874245] [2024-11-17 08:10:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:10,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841874245] [2024-11-17 08:10:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841874245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862490929] [2024-11-17 08:10:10,942 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:10:10,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:10,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:10,944 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:10,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-11-17 08:10:11,013 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-17 08:10:11,014 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:11,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 08:10:11,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:11,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:10:11,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 08:10:11,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:10:11,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 08:10:11,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:10:11,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-17 08:10:11,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:10:11,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 34 [2024-11-17 08:10:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:10:11,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:10:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:10:11,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862490929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:10:11,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:10:11,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 29 [2024-11-17 08:10:11,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530009596] [2024-11-17 08:10:11,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:10:11,656 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2024-11-17 08:10:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061545929] [2024-11-17 08:10:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:11,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:11,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 08:10:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2024-11-17 08:10:11,687 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 10 Second operand has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 29 states have internal predecessors, (84), 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-17 08:10:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:12,406 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2024-11-17 08:10:12,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 78 transitions. [2024-11-17 08:10:12,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:12,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 67 states and 74 transitions. [2024-11-17 08:10:12,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-17 08:10:12,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-17 08:10:12,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 74 transitions. [2024-11-17 08:10:12,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:12,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-17 08:10:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 74 transitions. [2024-11-17 08:10:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2024-11-17 08:10:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 48 states have internal predecessors, (55), 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-17 08:10:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-17 08:10:12,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-17 08:10:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-17 08:10:12,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-17 08:10:12,411 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:10:12,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-11-17 08:10:12,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:12,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:12,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:12,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:12,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:12,413 INFO L745 eck$LassoCheckResult]: Stem: 2444#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2445#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2448#L367 assume !(main_~length~0#1 < 1); 2446#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2447#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2456#L371 assume true; 2451#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2452#L371 assume true; 2457#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2468#L371 assume true; 2465#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2464#L371 assume true; 2449#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 2450#L374-3 main_~j~0#1 := 0; 2461#L374 assume true; 2442#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2443#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2488#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2487#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2462#L374 assume true; 2463#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2454#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2455#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2458#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2482#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2459#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2460#L374 assume true; 2486#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2485#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2484#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2483#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2475#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2476#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2471#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2472#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2466#L374 assume true; 2440#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 2441#L375 [2024-11-17 08:10:12,413 INFO L747 eck$LassoCheckResult]: Loop: 2441#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2453#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2441#L375 [2024-11-17 08:10:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash 106171695, now seen corresponding path program 6 times [2024-11-17 08:10:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559367080] [2024-11-17 08:10:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:12,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:12,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:12,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2024-11-17 08:10:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208098501] [2024-11-17 08:10:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:12,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:12,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1048215922, now seen corresponding path program 7 times [2024-11-17 08:10:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744009065] [2024-11-17 08:10:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:12,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:12,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:13,822 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:10:13,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:10:13,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:10:13,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:10:13,823 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:10:13,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:13,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:10:13,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:10:13,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2024-11-17 08:10:13,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:10:13,823 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:10:13,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:13,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:14,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:14,304 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:10:14,304 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:10:14,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,306 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-17 08:10:14,307 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-17 08:10:14,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,330 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-17 08:10:14,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,331 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-17 08:10:14,332 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-17 08:10:14,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,356 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-17 08:10:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,357 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-17 08:10:14,357 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-17 08:10:14,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,379 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-17 08:10:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,381 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-17 08:10:14,381 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-17 08:10:14,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,403 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-17 08:10:14,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,404 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-17 08:10:14,405 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-17 08:10:14,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,429 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-17 08:10:14,429 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-17 08:10:14,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:14,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-17 08:10:14,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,452 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-17 08:10:14,453 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-17 08:10:14,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-17 08:10:14,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:14,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,477 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-17 08:10:14,477 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-17 08:10:14,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,499 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-17 08:10:14,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,500 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-17 08:10:14,501 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-17 08:10:14,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:14,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:14,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:14,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,523 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-17 08:10:14,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,524 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-17 08:10:14,525 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-17 08:10:14,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:14,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:14,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-17 08:10:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,551 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-17 08:10:14,552 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-17 08:10: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-17 08:10:14,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:14,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:14,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:14,580 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-17 08:10:14,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,581 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-17 08:10:14,582 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-17 08:10:14,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-17 08:10:14,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:14,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:14,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:14,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:14,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:14,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:14,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:10:14,610 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:10:14,610 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-17 08:10:14,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:14,611 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-17 08:10:14,612 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-17 08:10:14,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:10:14,622 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:10:14,623 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:10:14,623 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-11-17 08:10:14,633 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-17 08:10:14,652 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2024-11-17 08:10:14,653 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-17 08:10:14,653 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-17 08:10:14,653 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-17 08:10:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:14,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:10:14,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:14,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:14,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:14,803 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-17 08:10:14,803 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:10:14,803 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 55 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-17 08:10:14,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 55 transitions. cyclomatic complexity: 11. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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) Result 49 states and 55 transitions. Complement of second has 4 states. [2024-11-17 08:10:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-17 08:10:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-17 08:10:14,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 37 letters. Loop has 2 letters. [2024-11-17 08:10:14,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:14,820 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:10:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:14,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:10:14,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:14,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:14,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:14,979 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-17 08:10:14,980 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:10:14,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 55 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-17 08:10:14,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 55 transitions. cyclomatic complexity: 11. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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) Result 49 states and 55 transitions. Complement of second has 4 states. [2024-11-17 08:10:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:10:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-17 08:10:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-17 08:10:14,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 37 letters. Loop has 2 letters. [2024-11-17 08:10:14,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:14,995 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:10:15,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:15,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:10:15,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:15,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:10:15,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:15,163 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-17 08:10:15,164 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:10:15,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 55 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-17 08:10:15,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 55 transitions. cyclomatic complexity: 11. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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) Result 64 states and 72 transitions. Complement of second has 14 states. [2024-11-17 08:10:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-17 08:10:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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-17 08:10:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2024-11-17 08:10:15,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 37 letters. Loop has 2 letters. [2024-11-17 08:10:15,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:15,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-17 08:10:15,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:15,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 37 letters. Loop has 4 letters. [2024-11-17 08:10:15,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:15,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-11-17 08:10:15,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:15,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 62 transitions. [2024-11-17 08:10:15,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:10:15,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-17 08:10:15,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2024-11-17 08:10:15,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:15,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-17 08:10:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2024-11-17 08:10:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-17 08:10:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 50 states have internal predecessors, (57), 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-17 08:10:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-17 08:10:15,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-17 08:10:15,273 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-17 08:10:15,273 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:10:15,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 57 transitions. [2024-11-17 08:10:15,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:15,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:15,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:15,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:15,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:15,278 INFO L745 eck$LassoCheckResult]: Stem: 3109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3110#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3113#L367 assume !(main_~length~0#1 < 1); 3111#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3112#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3120#L371 assume true; 3116#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3117#L371 assume true; 3121#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3133#L371 assume true; 3132#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3131#L371 assume true; 3114#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 3115#L374-3 main_~j~0#1 := 0; 3125#L374 assume true; 3126#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3155#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3154#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3153#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3127#L374 assume true; 3107#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3108#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3119#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3122#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3137#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3123#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3124#L374 assume true; 3152#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3151#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3150#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3149#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3148#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3147#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3146#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3145#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3144#L374 assume true; 3143#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3142#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3141#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3140#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3138#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3139#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3134#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3130#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3128#L374 assume true; 3105#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3106#L375 [2024-11-17 08:10:15,278 INFO L747 eck$LassoCheckResult]: Loop: 3106#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3118#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3106#L375 [2024-11-17 08:10:15,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:15,279 INFO L85 PathProgramCache]: Analyzing trace with hash -870834599, now seen corresponding path program 8 times [2024-11-17 08:10:15,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:15,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905383889] [2024-11-17 08:10:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:15,366 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-17 08:10:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 08:10:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905383889] [2024-11-17 08:10:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905383889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982701808] [2024-11-17 08:10:15,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:10:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:15,499 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:15,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2024-11-17 08:10:15,573 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:10:15,573 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:15,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:10:15,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 08:10:15,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:10:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 08:10:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982701808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:10:15,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:10:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2024-11-17 08:10:15,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468592016] [2024-11-17 08:10:15,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:10:15,837 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2024-11-17 08:10:15,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:15,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687698233] [2024-11-17 08:10:15,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:15,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:15,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 08:10:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-17 08:10:15,898 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. cyclomatic complexity: 12 Second operand has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 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-17 08:10:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:15,961 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-17 08:10:15,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 98 transitions. [2024-11-17 08:10:15,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:15,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 54 states and 60 transitions. [2024-11-17 08:10:15,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:10:15,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:10:15,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 60 transitions. [2024-11-17 08:10:15,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:15,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-17 08:10:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 60 transitions. [2024-11-17 08:10:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-17 08:10:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 52 states have internal predecessors, (59), 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-17 08:10:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-17 08:10:15,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-17 08:10:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:10:15,967 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-17 08:10:15,967 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:10:15,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2024-11-17 08:10:15,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:10:15,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:15,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:15,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:15,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:15,968 INFO L745 eck$LassoCheckResult]: Stem: 3541#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3542#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3545#L367 assume !(main_~length~0#1 < 1); 3543#L368-1 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3544#L369-1 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3552#L371 assume true; 3553#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3554#L371 assume true; 3548#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3549#L371 assume true; 3570#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3569#L371 assume true; 3566#L371-1 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3565#L371 assume true; 3546#L371-1 assume !(main_~i~0#1 < main_~length~0#1); 3547#L374-3 main_~j~0#1 := 0; 3559#L374 assume true; 3539#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3540#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3551#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3557#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3558#L374 assume true; 3560#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3589#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3555#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3556#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3588#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3587#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3586#L374 assume true; 3585#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3584#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3583#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3582#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3581#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3580#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3579#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3578#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3577#L374 assume true; 3576#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3575#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3574#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3573#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3571#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3572#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3564#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3563#L374-1 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3561#L374 assume true; 3537#L374-2 assume !!(main_~j~0#1 < main_~length~0#1); 3538#L375 [2024-11-17 08:10:15,969 INFO L747 eck$LassoCheckResult]: Loop: 3538#L375 assume true;call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3550#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3538#L375 [2024-11-17 08:10:15,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash 366775738, now seen corresponding path program 9 times [2024-11-17 08:10:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:15,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365841957] [2024-11-17 08:10:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 11 proven. 101 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 08:10:16,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365841957] [2024-11-17 08:10:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365841957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:16,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335923395] [2024-11-17 08:10:16,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:10:16,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:16,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:16,966 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:16,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2024-11-17 08:10:17,113 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-17 08:10:17,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:10:17,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 08:10:17,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:17,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:10:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-17 08:10:17,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:10:17,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 08:10:17,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:10:17,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-11-17 08:10:17,355 INFO L349 Elim1Store]: treesize reduction 100, result has 24.8 percent of original size [2024-11-17 08:10:17,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 52 treesize of output 67 [2024-11-17 08:10:18,037 INFO L349 Elim1Store]: treesize reduction 104, result has 30.2 percent of original size [2024-11-17 08:10:18,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 87 treesize of output 106 [2024-11-17 08:10:18,805 INFO L349 Elim1Store]: treesize reduction 212, result has 29.6 percent of original size [2024-11-17 08:10:18,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 124 treesize of output 162 [2024-11-17 08:10:20,020 INFO L349 Elim1Store]: treesize reduction 396, result has 51.1 percent of original size [2024-11-17 08:10:20,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 75 case distinctions, treesize of input 186 treesize of output 515