./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c -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 30e0974778487c3ac56035f1f8ab25ce73456d36b8987ec761ccfaf99f917331 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:34:32,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:34:32,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:34:32,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:34:32,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:34:32,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:34:32,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:34:32,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:34:32,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:34:32,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:34:32,747 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:34:32,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:34:32,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:34:32,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:34:32,748 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:34:32,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:34:32,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:34:32,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:34:32,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:34:32,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:34:32,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:34:32,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:34:32,751 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:34:32,751 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 30e0974778487c3ac56035f1f8ab25ce73456d36b8987ec761ccfaf99f917331 [2025-03-04 15:34:32,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:34:32,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:34:32,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:34:32,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:34:32,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:34:32,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2025-03-04 15:34:34,138 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98ac6b4/7ca7943827784fe5b9d0d3ba9b6c1e31/FLAG8d259939d [2025-03-04 15:34:34,317 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:34:34,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2025-03-04 15:34:34,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98ac6b4/7ca7943827784fe5b9d0d3ba9b6c1e31/FLAG8d259939d [2025-03-04 15:34:34,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98ac6b4/7ca7943827784fe5b9d0d3ba9b6c1e31 [2025-03-04 15:34:34,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:34:34,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:34:34,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:34:34,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:34:34,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:34:34,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34, skipping insertion in model container [2025-03-04 15:34:34,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:34:34,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:34:34,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:34:34,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:34:34,513 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:34:34,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34 WrapperNode [2025-03-04 15:34:34,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:34:34,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:34:34,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:34:34,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:34:34,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,532 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-03-04 15:34:34,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:34:34,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:34:34,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:34:34,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:34:34,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,542 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:34:34,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:34:34,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:34:34,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:34:34,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:34:34,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (1/1) ... [2025-03-04 15:34:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:34,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:34,580 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) [2025-03-04 15:34:34,583 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 [2025-03-04 15:34:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:34:34,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:34:34,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:34:34,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:34:34,717 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-04 15:34:34,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:34:34,723 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:34:34,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:34:34,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:34:34 BoogieIcfgContainer [2025-03-04 15:34:34,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:34:34,724 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:34:34,724 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:34:34,728 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:34:34,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:34:34,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:34:34" (1/3) ... [2025-03-04 15:34:34,729 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cc80851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:34:34, skipping insertion in model container [2025-03-04 15:34:34,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:34:34,729 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:34:34" (2/3) ... [2025-03-04 15:34:34,729 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cc80851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:34:34, skipping insertion in model container [2025-03-04 15:34:34,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:34:34,729 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:34:34" (3/3) ... [2025-03-04 15:34:34,730 INFO L363 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2025-03-04 15:34:34,765 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:34:34,766 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:34:34,766 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:34:34,766 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:34:34,766 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:34:34,766 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:34:34,766 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:34:34,766 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:34:34,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2025-03-04 15:34:34,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:34:34,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:34,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:34,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:34:34,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:34,781 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:34:34,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2025-03-04 15:34:34,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:34:34,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:34,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:34,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:34:34,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:34,788 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" [2025-03-04 15:34:34,788 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" "main_~y~0#1 := main_~y~0#1 - 1;" [2025-03-04 15:34:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2025-03-04 15:34:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260376092] [2025-03-04 15:34:34,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:34:34,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:34:34,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:34,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:34,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:34,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:34:34,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:34:34,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:34,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:34,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 44643, now seen corresponding path program 1 times [2025-03-04 15:34:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690248532] [2025-03-04 15:34:34,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:34,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:34,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:34,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:34,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:34,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:34,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:34,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:34,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:34,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 44820516, now seen corresponding path program 1 times [2025-03-04 15:34:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710450519] [2025-03-04 15:34:34,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:34,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:34:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:34:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:34,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:34,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:34:34,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:34:34,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:34,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:34,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:34,952 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:34,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:34,953 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:34,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:34,954 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:34,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:34,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:34,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:34,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2025-03-04 15:34:34,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:34,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:34,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:34,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:34,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:34,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:34,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,052 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:35,053 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,056 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) [2025-03-04 15:34:35,058 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 [2025-03-04 15:34:35,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,081 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:35,081 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:35,089 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 [2025-03-04 15:34:35,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,092 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) [2025-03-04 15:34:35,092 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 [2025-03-04 15:34:35,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,114 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:35,114 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:35,120 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 [2025-03-04 15:34:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,123 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) [2025-03-04 15:34:35,123 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 [2025-03-04 15:34:35,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,144 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:35,144 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:35,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:35,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,152 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) [2025-03-04 15:34:35,153 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 [2025-03-04 15:34:35,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,166 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:35,166 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:35,173 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 [2025-03-04 15:34:35,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,175 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) [2025-03-04 15:34:35,177 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 [2025-03-04 15:34:35,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,198 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 [2025-03-04 15:34:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,200 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) [2025-03-04 15:34:35,202 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 [2025-03-04 15:34:35,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:35,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,227 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:35,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-04 15:34:35,231 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:35,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:35,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:35,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:35,231 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:35,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:35,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:35,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2025-03-04 15:34:35,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:35,232 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:35,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,289 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:35,292 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:35,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,295 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) [2025-03-04 15:34:35,298 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 [2025-03-04 15:34:35,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:35,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:35,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:35,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:35,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:35,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:35,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:35,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:35,334 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 [2025-03-04 15:34:35,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,336 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) [2025-03-04 15:34:35,337 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 [2025-03-04 15:34:35,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:35,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:35,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:35,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:35,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:35,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:35,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:35,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:35,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,366 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) [2025-03-04 15:34:35,368 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 [2025-03-04 15:34:35,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:35,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:35,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:35,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:35,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:35,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:35,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:35,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:35,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:35,388 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 [2025-03-04 15:34:35,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,390 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) [2025-03-04 15:34:35,391 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 [2025-03-04 15:34:35,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:35,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:35,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:35,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:35,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:35,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:35,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:35,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:35,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:35,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:34:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,412 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) [2025-03-04 15:34:35,413 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 [2025-03-04 15:34:35,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:35,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:35,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:35,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:35,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:35,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:35,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:35,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:35,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:35,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:35,434 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:34:35,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,437 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) [2025-03-04 15:34:35,438 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 [2025-03-04 15:34:35,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:35,440 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:35,440 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:35,440 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 2*ULTIMATE.start_main_~y~0#1 + 1 Supporting invariants [] [2025-03-04 15:34:35,446 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 [2025-03-04 15:34:35,448 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:35,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:34:35,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:34:35,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:35,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:35,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:35,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:35,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:35,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:35,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:35,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:35,496 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:35,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:35,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:34:35,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:35,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 54 transitions. Complement of second has 6 states. [2025-03-04 15:34:35,587 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 [2025-03-04 15:34:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-03-04 15:34:35,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-04 15:34:35,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:35,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 15:34:35,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:35,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-04 15:34:35,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:35,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2025-03-04 15:34:35,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:34:35,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 21 states and 30 transitions. [2025-03-04 15:34:35,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:34:35,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-04 15:34:35,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2025-03-04 15:34:35,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:35,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-03-04 15:34:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2025-03-04 15:34:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 15:34:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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) [2025-03-04 15:34:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2025-03-04 15:34:35,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-03-04 15:34:35,621 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-03-04 15:34:35,621 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:34:35,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2025-03-04 15:34:35,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:34:35,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:35,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:35,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:35,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:35,622 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume !main_#t~short3#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" [2025-03-04 15:34:35,622 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" [2025-03-04 15:34:35,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash 122821131, now seen corresponding path program 1 times [2025-03-04 15:34:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272643336] [2025-03-04 15:34:35,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:35,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:35,657 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 [2025-03-04 15:34:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:34:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272643336] [2025-03-04 15:34:35,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272643336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:34:35,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:34:35,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:34:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916825466] [2025-03-04 15:34:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:34:35,683 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:34:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 1 times [2025-03-04 15:34:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272982243] [2025-03-04 15:34:35,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:35,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:35,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:35,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:35,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:35,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:35,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:35,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:35,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:35,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:35,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:35,759 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:35,759 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:35,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:35,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:35,760 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:35,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:35,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:35,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2025-03-04 15:34:35,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:35,760 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:35,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,813 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:35,813 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:35,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,815 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) [2025-03-04 15:34:35,815 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 [2025-03-04 15:34:35,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,833 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:35,833 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:35,838 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 [2025-03-04 15:34:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,840 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) [2025-03-04 15:34:35,841 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 [2025-03-04 15:34:35,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,860 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:35,860 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:35,865 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 [2025-03-04 15:34:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,867 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) [2025-03-04 15:34:35,868 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 [2025-03-04 15:34:35,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:35,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:34:35,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:35,887 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) [2025-03-04 15:34:35,888 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 [2025-03-04 15:34:35,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:35,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:35,953 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:35,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:34:35,958 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:35,958 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:35,958 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:35,958 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:35,958 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:35,958 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:35,958 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:35,958 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:35,958 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2025-03-04 15:34:35,958 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:35,958 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:35,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:35,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,009 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:36,009 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:36,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,012 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) [2025-03-04 15:34:36,013 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 [2025-03-04 15:34:36,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:36,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:36,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:36,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:36,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:36,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:36,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:36,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:36,035 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 [2025-03-04 15:34:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,038 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) [2025-03-04 15:34:36,039 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 [2025-03-04 15:34:36,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 [2025-03-04 15:34:36,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:36,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:36,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:36,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:36,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:36,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:36,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:36,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:36,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:36,055 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:34:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,068 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) [2025-03-04 15:34:36,069 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 [2025-03-04 15:34:36,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:36,070 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:36,070 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:36,070 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~m~0#1) = -2*ULTIMATE.start_main_~y~0#1 + 2*ULTIMATE.start_main_~m~0#1 + 1 Supporting invariants [] [2025-03-04 15:34:36,075 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 [2025-03-04 15:34:36,076 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:36,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:36,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:36,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:36,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:36,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:36,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:36,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:36,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:36,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:36,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:34:36,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:36,157 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:36,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 15:34:36,193 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 44 states and 63 transitions. Complement of second has 10 states. [2025-03-04 15:34:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 15:34:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2025-03-04 15:34:36,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:34:36,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:36,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:34:36,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:36,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:34:36,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:36,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 63 transitions. [2025-03-04 15:34:36,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:34:36,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 33 states and 46 transitions. [2025-03-04 15:34:36,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-04 15:34:36,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-04 15:34:36,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2025-03-04 15:34:36,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:36,196 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-03-04 15:34:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2025-03-04 15:34:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2025-03-04 15:34:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 26 states have internal predecessors, (40), 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) [2025-03-04 15:34:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2025-03-04 15:34:36,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 40 transitions. [2025-03-04 15:34:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:34:36,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:34:36,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:34:36,200 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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) [2025-03-04 15:34:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:34:36,208 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-04 15:34:36,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2025-03-04 15:34:36,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:34:36,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 40 transitions. [2025-03-04 15:34:36,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-04 15:34:36,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-04 15:34:36,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2025-03-04 15:34:36,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:36,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-04 15:34:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2025-03-04 15:34:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-04 15:34:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 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) [2025-03-04 15:34:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-04 15:34:36,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-04 15:34:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:34:36,213 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-04 15:34:36,213 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:34:36,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2025-03-04 15:34:36,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-04 15:34:36,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:36,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:36,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:36,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:36,214 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume !main_#t~short3#1;" [2025-03-04 15:34:36,214 INFO L754 eck$LassoCheckResult]: Loop: "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume !main_#t~short3#1;" [2025-03-04 15:34:36,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2066960459, now seen corresponding path program 1 times [2025-03-04 15:34:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:36,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181901142] [2025-03-04 15:34:36,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:36,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:34:36,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:34:36,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:36,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:36,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:34:36,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:34:36,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:36,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -516851614, now seen corresponding path program 1 times [2025-03-04 15:34:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875839582] [2025-03-04 15:34:36,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:36,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:36,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:36,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:36,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:36,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:36,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:36,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:36,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1538990296, now seen corresponding path program 1 times [2025-03-04 15:34:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:36,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554902324] [2025-03-04 15:34:36,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:36,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:34:36,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:34:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:34:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554902324] [2025-03-04 15:34:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554902324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:34:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352576277] [2025-03-04 15:34:36,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:36,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:34:36,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,356 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:34:36,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:34:36,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:34:36,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:34:36,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:36,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:34:36,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:36,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:34:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352576277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:34:36,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:34:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 15:34:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832826389] [2025-03-04 15:34:36,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:34:36,641 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 [2025-03-04 15:34:36,665 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:36,665 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:36,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:36,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:36,665 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:36,665 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,665 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:36,665 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:36,665 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2025-03-04 15:34:36,665 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:36,665 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:36,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:36,742 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:36,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,743 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) [2025-03-04 15:34:36,745 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 [2025-03-04 15:34:36,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:36,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:36,761 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 [2025-03-04 15:34:36,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,763 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) [2025-03-04 15:34:36,764 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 [2025-03-04 15:34:36,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:36,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:36,797 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:36,801 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 [2025-03-04 15:34:36,801 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:36,801 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:36,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:36,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:36,801 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:36,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:36,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:36,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2025-03-04 15:34:36,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:36,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:36,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:36,868 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:36,868 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:36,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,872 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:36,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:34:36,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:36,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:36,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:36,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:36,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:36,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:36,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:36,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:36,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:36,887 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:36,887 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:34:36,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:36,889 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) [2025-03-04 15:34:36,890 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 [2025-03-04 15:34:36,891 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:36,891 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:36,891 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:36,891 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:34:36,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:34:36,896 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:36,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:34:36,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:34:36,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:36,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:36,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:36,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:36,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:36,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:36,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:36,957 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:36,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 37 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2025-03-04 15:34:36,975 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 37 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) Result 92 states and 128 transitions. Complement of second has 6 states. [2025-03-04 15:34:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2025-03-04 15:34:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-03-04 15:34:36,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 7 letters. [2025-03-04 15:34:36,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:36,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 16 letters. Loop has 7 letters. [2025-03-04 15:34:36,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:36,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 14 letters. [2025-03-04 15:34:36,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:36,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 128 transitions. [2025-03-04 15:34:36,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-04 15:34:36,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 68 states and 93 transitions. [2025-03-04 15:34:36,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-04 15:34:36,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 15:34:36,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 93 transitions. [2025-03-04 15:34:36,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:36,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 93 transitions. [2025-03-04 15:34:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 93 transitions. [2025-03-04 15:34:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2025-03-04 15:34:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 57 states have internal predecessors, (80), 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) [2025-03-04 15:34:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2025-03-04 15:34:36,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 80 transitions. [2025-03-04 15:34:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:34:36,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:34:36,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:34:36,990 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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) [2025-03-04 15:34:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:34:37,287 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2025-03-04 15:34:37,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 143 transitions. [2025-03-04 15:34:37,290 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-03-04 15:34:37,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 97 states and 122 transitions. [2025-03-04 15:34:37,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-03-04 15:34:37,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-03-04 15:34:37,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 122 transitions. [2025-03-04 15:34:37,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:37,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 122 transitions. [2025-03-04 15:34:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 122 transitions. [2025-03-04 15:34:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2025-03-04 15:34:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 77 states have internal predecessors, (102), 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) [2025-03-04 15:34:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-03-04 15:34:37,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-04 15:34:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 15:34:37,299 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-04 15:34:37,299 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:34:37,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 102 transitions. [2025-03-04 15:34:37,300 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2025-03-04 15:34:37,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:37,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:37,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:37,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:37,300 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" [2025-03-04 15:34:37,300 INFO L754 eck$LassoCheckResult]: Loop: "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" [2025-03-04 15:34:37,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash -348735235, now seen corresponding path program 1 times [2025-03-04 15:34:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182450931] [2025-03-04 15:34:37,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:37,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:34:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:34:37,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:37,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:34:37,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:34:37,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:37,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1097996171, now seen corresponding path program 1 times [2025-03-04 15:34:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:37,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947641288] [2025-03-04 15:34:37,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:37,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:37,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:37,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:37,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:37,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:37,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:37,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2023453937, now seen corresponding path program 1 times [2025-03-04 15:34:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672438603] [2025-03-04 15:34:37,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:37,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:34:37,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:37,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:37,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:34:37,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:37,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:37,394 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:37,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:37,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:37,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:37,395 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:37,395 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,395 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:37,395 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:37,395 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2025-03-04 15:34:37,395 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:37,395 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:37,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,459 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:37,459 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:37,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,462 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) [2025-03-04 15:34:37,464 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 [2025-03-04 15:34:37,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:37,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:37,483 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 [2025-03-04 15:34:37,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,485 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) [2025-03-04 15:34:37,486 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 [2025-03-04 15:34:37,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:37,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:37,549 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:37,553 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 [2025-03-04 15:34:37,553 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:37,553 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:37,553 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:37,553 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:37,553 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:37,553 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,553 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:37,553 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:37,553 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2025-03-04 15:34:37,553 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:37,554 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:37,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,609 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:37,609 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:37,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,613 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) [2025-03-04 15:34:37,613 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 [2025-03-04 15:34:37,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:37,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:37,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:37,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:37,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:37,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:37,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:37,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:37,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:37,631 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 [2025-03-04 15:34:37,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,633 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) [2025-03-04 15:34:37,634 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 [2025-03-04 15:34:37,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:37,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:37,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:37,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:37,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:37,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:37,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:37,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:37,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:37,648 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:34:37,648 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:34:37,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,650 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) [2025-03-04 15:34:37,651 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 [2025-03-04 15:34:37,651 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:37,651 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:37,651 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:37,651 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-03-04 15:34:37,656 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 [2025-03-04 15:34:37,657 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:37,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:37,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:34:37,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:34:37,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:37,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:37,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:37,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:37,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:37,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:37,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:37,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:37,717 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:37,717 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 102 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2025-03-04 15:34:37,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:34:37,740 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 [2025-03-04 15:34:37,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 102 transitions. cyclomatic complexity: 32. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) Result 180 states and 242 transitions. Complement of second has 7 states. [2025-03-04 15:34:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2025-03-04 15:34:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-03-04 15:34:37,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-04 15:34:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 7 letters. [2025-03-04 15:34:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 14 letters. [2025-03-04 15:34:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:37,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 242 transitions. [2025-03-04 15:34:37,754 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2025-03-04 15:34:37,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 148 states and 194 transitions. [2025-03-04 15:34:37,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-04 15:34:37,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-03-04 15:34:37,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 194 transitions. [2025-03-04 15:34:37,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:37,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 194 transitions. [2025-03-04 15:34:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 194 transitions. [2025-03-04 15:34:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2025-03-04 15:34:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 134 states have internal predecessors, (181), 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) [2025-03-04 15:34:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2025-03-04 15:34:37,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 135 states and 181 transitions. [2025-03-04 15:34:37,768 INFO L432 stractBuchiCegarLoop]: Abstraction has 135 states and 181 transitions. [2025-03-04 15:34:37,768 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:34:37,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 181 transitions. [2025-03-04 15:34:37,769 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2025-03-04 15:34:37,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:37,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:37,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:34:37,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:37,771 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" [2025-03-04 15:34:37,771 INFO L754 eck$LassoCheckResult]: Loop: "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" [2025-03-04 15:34:37,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash -212560697, now seen corresponding path program 2 times [2025-03-04 15:34:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840552209] [2025-03-04 15:34:37,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:34:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:37,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 15:34:37,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:37,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:34:37,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:34:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:34:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840552209] [2025-03-04 15:34:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840552209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:34:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:34:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:34:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936293482] [2025-03-04 15:34:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:34:37,809 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:34:37,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1097996171, now seen corresponding path program 2 times [2025-03-04 15:34:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523964989] [2025-03-04 15:34:37,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:34:37,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:37,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:37,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:37,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:34:37,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:37,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:37,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:37,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:37,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:37,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:37,860 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:37,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:37,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:37,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:37,860 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:37,861 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,861 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:37,861 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:37,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2025-03-04 15:34:37,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:37,861 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:37,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:37,919 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:37,919 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:37,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,921 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) [2025-03-04 15:34:37,922 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 [2025-03-04 15:34:37,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:37,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:37,946 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:37,946 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite ULTIMATE.start_main_#t~short3#1 1 0)_7=0} Honda state: {v_rep(ite ULTIMATE.start_main_#t~short3#1 1 0)_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:37,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:37,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,954 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) [2025-03-04 15:34:37,955 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 [2025-03-04 15:34:37,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:37,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:37,967 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:37,968 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:37,973 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 [2025-03-04 15:34:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,975 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) [2025-03-04 15:34:37,976 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 [2025-03-04 15:34:37,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:37,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:37,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:34:37,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:37,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:37,996 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) [2025-03-04 15:34:38,001 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 [2025-03-04 15:34:38,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:38,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:38,068 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:38,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 15:34:38,073 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:38,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:38,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:38,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:38,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:38,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:38,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:38,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2025-03-04 15:34:38,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:38,073 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:38,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,129 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:38,129 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:38,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,131 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:38,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:34:38,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:34:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,151 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:38,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:34:38,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:34:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,172 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) [2025-03-04 15:34:38,173 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 [2025-03-04 15:34:38,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:38,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:38,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,192 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 [2025-03-04 15:34:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,194 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) [2025-03-04 15:34:38,196 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 [2025-03-04 15:34:38,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,214 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 [2025-03-04 15:34:38,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,216 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) [2025-03-04 15:34:38,217 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 [2025-03-04 15:34:38,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:38,234 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:38,234 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:34:38,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,236 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) [2025-03-04 15:34:38,237 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 [2025-03-04 15:34:38,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:38,237 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:38,237 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:38,237 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-03-04 15:34:38,242 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 [2025-03-04 15:34:38,243 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:38,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:34:38,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:38,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:38,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:38,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:38,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:38,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:38,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:38,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:38,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:38,306 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:38,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 135 states and 181 transitions. cyclomatic complexity: 60 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-04 15:34:38,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 135 states and 181 transitions. cyclomatic complexity: 60. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 203 states and 269 transitions. Complement of second has 7 states. [2025-03-04 15:34:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-04 15:34:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-03-04 15:34:38,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 7 letters. [2025-03-04 15:34:38,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,321 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:34:38,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:38,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:38,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:38,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:38,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:34:38,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:34:38,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:38,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:38,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:38,378 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:38,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 135 states and 181 transitions. cyclomatic complexity: 60 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-04 15:34:38,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 135 states and 181 transitions. cyclomatic complexity: 60. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 315 states and 418 transitions. Complement of second has 9 states. [2025-03-04 15:34:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-04 15:34:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-03-04 15:34:38,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 17 letters. Loop has 7 letters. [2025-03-04 15:34:38,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 24 letters. Loop has 7 letters. [2025-03-04 15:34:38,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 17 letters. Loop has 14 letters. [2025-03-04 15:34:38,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 418 transitions. [2025-03-04 15:34:38,419 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 48 [2025-03-04 15:34:38,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 281 states and 370 transitions. [2025-03-04 15:34:38,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2025-03-04 15:34:38,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-03-04 15:34:38,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 370 transitions. [2025-03-04 15:34:38,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:38,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 281 states and 370 transitions. [2025-03-04 15:34:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 370 transitions. [2025-03-04 15:34:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 204. [2025-03-04 15:34:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 203 states have internal predecessors, (279), 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) [2025-03-04 15:34:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2025-03-04 15:34:38,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 279 transitions. [2025-03-04 15:34:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:34:38,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:34:38,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:34:38,438 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:34:38,449 INFO L93 Difference]: Finished difference Result 184 states and 250 transitions. [2025-03-04 15:34:38,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 250 transitions. [2025-03-04 15:34:38,450 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 43 [2025-03-04 15:34:38,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 175 states and 241 transitions. [2025-03-04 15:34:38,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-03-04 15:34:38,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-03-04 15:34:38,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 241 transitions. [2025-03-04 15:34:38,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:38,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 241 transitions. [2025-03-04 15:34:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 241 transitions. [2025-03-04 15:34:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 15:34:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 174 states have internal predecessors, (241), 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) [2025-03-04 15:34:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 241 transitions. [2025-03-04 15:34:38,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 175 states and 241 transitions. [2025-03-04 15:34:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:34:38,463 INFO L432 stractBuchiCegarLoop]: Abstraction has 175 states and 241 transitions. [2025-03-04 15:34:38,463 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:34:38,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 241 transitions. [2025-03-04 15:34:38,464 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 43 [2025-03-04 15:34:38,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:38,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:38,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:38,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:38,464 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:34:38,465 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:34:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1895182054, now seen corresponding path program 3 times [2025-03-04 15:34:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-04 15:34:38,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:34:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:38,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 3 equivalence classes. [2025-03-04 15:34:38,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:38,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:34:38,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:34:38,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:38,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:38,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash -551384675, now seen corresponding path program 1 times [2025-03-04 15:34:38,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-03-04 15:34:38,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:38,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:34:38,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:34:38,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:38,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:34:38,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:34:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:38,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash 925929334, now seen corresponding path program 4 times [2025-03-04 15:34:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016203816] [2025-03-04 15:34:38,488 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:34:38,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:38,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 15:34:38,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:34:38,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:34:38,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:38,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:34:38,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:34:38,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:38,554 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:38,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:38,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:38,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:38,554 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:38,554 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,554 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:38,554 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:38,554 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2025-03-04 15:34:38,554 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:38,554 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:38,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,606 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:38,606 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:38,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,608 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) [2025-03-04 15:34:38,610 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 [2025-03-04 15:34:38,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:38,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:38,631 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:38,631 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:38,637 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 [2025-03-04 15:34:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,639 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) [2025-03-04 15:34:38,639 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 [2025-03-04 15:34:38,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:38,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:38,666 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:38,666 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:38,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-04 15:34:38,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,674 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) [2025-03-04 15:34:38,675 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 [2025-03-04 15:34:38,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:38,675 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:38,686 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:38,686 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite ULTIMATE.start_main_#t~short3#1 1 0)_9=0} Honda state: {v_rep(ite ULTIMATE.start_main_#t~short3#1 1 0)_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:38,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:34:38,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,694 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) [2025-03-04 15:34:38,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:38,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:38,697 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 [2025-03-04 15:34:38,712 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 [2025-03-04 15:34:38,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,714 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) [2025-03-04 15:34:38,715 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 [2025-03-04 15:34:38,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:38,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:38,748 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:38,752 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 [2025-03-04 15:34:38,752 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:38,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:38,752 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:38,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:38,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:38,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:38,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:38,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2025-03-04 15:34:38,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:38,752 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:38,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:38,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-04 15:34:38,818 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:38,819 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:38,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,820 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) [2025-03-04 15:34:38,821 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 [2025-03-04 15:34:38,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,839 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 [2025-03-04 15:34:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,840 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) [2025-03-04 15:34:38,841 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 [2025-03-04 15:34:38,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,860 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 [2025-03-04 15:34:38,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,862 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) [2025-03-04 15:34:38,863 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 [2025-03-04 15:34:38,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:38,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:38,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:38,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:38,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,887 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) [2025-03-04 15:34:38,887 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 [2025-03-04 15:34:38,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:38,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:38,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:38,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:38,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:38,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:38,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:38,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:38,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:38,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:38,903 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:34:38,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:38,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:38,906 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) [2025-03-04 15:34:38,906 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 [2025-03-04 15:34:38,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:38,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:38,907 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:38,907 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:34:38,912 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 [2025-03-04 15:34:38,913 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:38,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:34:38,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:38,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:38,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:38,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:34:38,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:34:38,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:38,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:38,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:34:38,961 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:38,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 241 transitions. cyclomatic complexity: 85 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:38,974 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 241 transitions. cyclomatic complexity: 85. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 440 states and 607 transitions. Complement of second has 6 states. [2025-03-04 15:34:38,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-03-04 15:34:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 10 letters. [2025-03-04 15:34:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 24 letters. Loop has 10 letters. [2025-03-04 15:34:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 20 letters. [2025-03-04 15:34:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:38,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 607 transitions. [2025-03-04 15:34:38,978 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-03-04 15:34:38,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 266 states and 367 transitions. [2025-03-04 15:34:38,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-03-04 15:34:38,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-03-04 15:34:38,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 367 transitions. [2025-03-04 15:34:38,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:38,980 INFO L218 hiAutomatonCegarLoop]: Abstraction has 266 states and 367 transitions. [2025-03-04 15:34:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 367 transitions. [2025-03-04 15:34:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 120. [2025-03-04 15:34:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.4) internal successors, (168), 119 states have internal predecessors, (168), 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) [2025-03-04 15:34:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-03-04 15:34:38,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-03-04 15:34:38,983 INFO L432 stractBuchiCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-03-04 15:34:38,983 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:34:38,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 168 transitions. [2025-03-04 15:34:38,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:34:38,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:38,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:38,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:34:38,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:38,984 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-04 15:34:38,984 INFO L754 eck$LassoCheckResult]: Loop: "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" [2025-03-04 15:34:38,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1895182054, now seen corresponding path program 5 times [2025-03-04 15:34:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:38,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380216896] [2025-03-04 15:34:38,984 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:34:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:38,987 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 3 equivalence classes. [2025-03-04 15:34:38,992 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:38,992 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 15:34:38,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:38,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:34:38,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:38,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:38,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:38,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:39,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 2 times [2025-03-04 15:34:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972155052] [2025-03-04 15:34:39,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:34:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:39,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:34:39,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:39,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2023453936, now seen corresponding path program 6 times [2025-03-04 15:34:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:39,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963213331] [2025-03-04 15:34:39,004 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:34:39,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:39,006 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 3 equivalence classes. [2025-03-04 15:34:39,011 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:39,011 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 15:34:39,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:39,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:34:39,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:34:39,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:39,042 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:39,043 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:39,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:39,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:39,043 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:39,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:39,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:39,043 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2025-03-04 15:34:39,043 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:39,043 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:39,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,077 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:39,077 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:39,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,078 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) [2025-03-04 15:34:39,079 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 [2025-03-04 15:34:39,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:39,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,095 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 [2025-03-04 15:34:39,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,097 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:39,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:34:39,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:39,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,164 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:39,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:39,169 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:39,169 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:39,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:39,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:39,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:39,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:39,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:39,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2025-03-04 15:34:39,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:39,172 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:39,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,200 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:39,201 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:39,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,203 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:39,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:34:39,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:39,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:39,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:39,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:39,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:39,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:39,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:39,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:39,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:39,220 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:39,220 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:34:39,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,222 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) [2025-03-04 15:34:39,223 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 [2025-03-04 15:34:39,224 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:39,224 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:39,224 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:39,224 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~m~0#1) = -2*ULTIMATE.start_main_~y~0#1 + 2*ULTIMATE.start_main_~m~0#1 + 1 Supporting invariants [] [2025-03-04 15:34:39,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:34:39,230 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:34:39,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:39,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:39,296 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:39,296 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 168 transitions. cyclomatic complexity: 60 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:39,322 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 168 transitions. cyclomatic complexity: 60. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 152 states and 205 transitions. Complement of second has 9 states. [2025-03-04 15:34:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-04 15:34:39,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:34:39,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:39,323 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:39,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:34:39,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:39,388 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:39,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 168 transitions. cyclomatic complexity: 60 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:39,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 168 transitions. cyclomatic complexity: 60. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 152 states and 205 transitions. Complement of second has 9 states. [2025-03-04 15:34:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-04 15:34:39,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:34:39,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:39,412 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:34:39,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:34:39,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:39,479 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:39,480 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 168 transitions. cyclomatic complexity: 60 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:39,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 168 transitions. cyclomatic complexity: 60. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 224 states and 284 transitions. Complement of second has 8 states. [2025-03-04 15:34:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2025-03-04 15:34:39,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-04 15:34:39,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:39,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-04 15:34:39,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:39,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-04 15:34:39,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:39,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 284 transitions. [2025-03-04 15:34:39,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:39,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 146 states and 187 transitions. [2025-03-04 15:34:39,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:34:39,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:34:39,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 187 transitions. [2025-03-04 15:34:39,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:39,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 187 transitions. [2025-03-04 15:34:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 187 transitions. [2025-03-04 15:34:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2025-03-04 15:34:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 106 states have internal predecessors, (143), 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) [2025-03-04 15:34:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2025-03-04 15:34:39,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 143 transitions. [2025-03-04 15:34:39,523 INFO L432 stractBuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2025-03-04 15:34:39,523 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:34:39,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 143 transitions. [2025-03-04 15:34:39,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:39,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:39,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:39,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 15:34:39,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:39,524 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2025-03-04 15:34:39,524 INFO L754 eck$LassoCheckResult]: Loop: "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2025-03-04 15:34:39,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash 925929335, now seen corresponding path program 1 times [2025-03-04 15:34:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104631882] [2025-03-04 15:34:39,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:39,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:34:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:34:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:39,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:34:39,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:34:39,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 33153, now seen corresponding path program 2 times [2025-03-04 15:34:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331140411] [2025-03-04 15:34:39,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:34:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:39,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:34:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:39,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:39,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:39,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2080847435, now seen corresponding path program 2 times [2025-03-04 15:34:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4102381] [2025-03-04 15:34:39,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:34:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:39,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:34:39,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:34:39,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:34:39,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:34:39,619 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 [2025-03-04 15:34:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:34:39,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:34:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4102381] [2025-03-04 15:34:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4102381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:34:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900409720] [2025-03-04 15:34:39,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:34:39,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:34:39,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,638 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:34:39,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-03-04 15:34:39,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:34:39,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:34:39,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:34:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:39,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:34:39,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:34:39,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:34:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 15:34:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900409720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:34:39,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:34:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-04 15:34:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565973229] [2025-03-04 15:34:39,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:34:39,739 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:39,739 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:39,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:39,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:39,739 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:39,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:39,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:39,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2025-03-04 15:34:39,739 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:39,739 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:39,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,769 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:39,769 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:39,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,771 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) [2025-03-04 15:34:39,772 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 [2025-03-04 15:34:39,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:39,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,789 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:39,790 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:39,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-04 15:34:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,797 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) [2025-03-04 15:34:39,797 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 [2025-03-04 15:34:39,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:39,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,815 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:39,815 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:39,821 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 [2025-03-04 15:34:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,823 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) [2025-03-04 15:34:39,823 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 [2025-03-04 15:34:39,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:39,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,835 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:39,835 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:39,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-04 15:34:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,843 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) [2025-03-04 15:34:39,844 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 [2025-03-04 15:34:39,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:39,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,861 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:39,861 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:39,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:39,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,868 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) [2025-03-04 15:34:39,869 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 [2025-03-04 15:34:39,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:39,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:34:39,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,887 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) [2025-03-04 15:34:39,887 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 [2025-03-04 15:34:39,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:39,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:39,929 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:39,932 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 [2025-03-04 15:34:39,933 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:39,933 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:39,933 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:39,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:39,933 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:39,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:39,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:39,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2025-03-04 15:34:39,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:39,933 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:39,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:39,966 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:39,966 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:39,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,968 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) [2025-03-04 15:34:39,968 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 [2025-03-04 15:34:39,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:39,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:39,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:39,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:39,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:39,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:39,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:39,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:39,988 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 [2025-03-04 15:34:39,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:39,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:39,990 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) [2025-03-04 15:34:39,991 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 [2025-03-04 15:34:39,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:40,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:40,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:40,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:40,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:40,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,013 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) [2025-03-04 15:34:40,014 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 [2025-03-04 15:34:40,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:40,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:40,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:40,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:40,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,034 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) [2025-03-04 15:34:40,036 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 [2025-03-04 15:34:40,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:40,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:40,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:40,049 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:40,050 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:34:40,050 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:34:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,052 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) [2025-03-04 15:34:40,053 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 [2025-03-04 15:34:40,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:40,054 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:40,054 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:40,054 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-03-04 15:34:40,060 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 [2025-03-04 15:34:40,061 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:40,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:34:40,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:34:40,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:40,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,099 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:40,119 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:40,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 143 transitions. cyclomatic complexity: 46 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:40,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 143 transitions. cyclomatic complexity: 46. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 335 states and 456 transitions. Complement of second has 7 states. [2025-03-04 15:34:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2025-03-04 15:34:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-04 15:34:40,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-04 15:34:40,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 27 letters. Loop has 3 letters. [2025-03-04 15:34:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 24 letters. Loop has 6 letters. [2025-03-04 15:34:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 456 transitions. [2025-03-04 15:34:40,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:40,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 266 states and 350 transitions. [2025-03-04 15:34:40,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:34:40,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:34:40,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 350 transitions. [2025-03-04 15:34:40,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:40,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 266 states and 350 transitions. [2025-03-04 15:34:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 350 transitions. [2025-03-04 15:34:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 204. [2025-03-04 15:34:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 1.3284313725490196) internal successors, (271), 203 states have internal predecessors, (271), 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) [2025-03-04 15:34:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 271 transitions. [2025-03-04 15:34:40,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 271 transitions. [2025-03-04 15:34:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:34:40,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:34:40,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:34:40,151 INFO L87 Difference]: Start difference. First operand 204 states and 271 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-04 15:34:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:34:40,168 INFO L93 Difference]: Finished difference Result 187 states and 240 transitions. [2025-03-04 15:34:40,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 240 transitions. [2025-03-04 15:34:40,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:40,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 156 states and 206 transitions. [2025-03-04 15:34:40,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:34:40,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:34:40,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 206 transitions. [2025-03-04 15:34:40,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:40,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 206 transitions. [2025-03-04 15:34:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 206 transitions. [2025-03-04 15:34:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2025-03-04 15:34:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 148 states have internal predecessors, (199), 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) [2025-03-04 15:34:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 199 transitions. [2025-03-04 15:34:40,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 199 transitions. [2025-03-04 15:34:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:34:40,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 149 states and 199 transitions. [2025-03-04 15:34:40,175 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:34:40,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 199 transitions. [2025-03-04 15:34:40,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:40,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:40,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:40,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1] [2025-03-04 15:34:40,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:40,176 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume !main_#t~short3#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume !main_#t~short3#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2025-03-04 15:34:40,176 INFO L754 eck$LassoCheckResult]: Loop: "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2025-03-04 15:34:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1595777547, now seen corresponding path program 1 times [2025-03-04 15:34:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:40,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216845287] [2025-03-04 15:34:40,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:40,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:40,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:34:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:34:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216845287] [2025-03-04 15:34:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216845287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:34:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948313281] [2025-03-04 15:34:40,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:34:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:34:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,258 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) [2025-03-04 15:34:40,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-03-04 15:34:40,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:40,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:40,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:34:40,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:34:40,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-04 15:34:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:34:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948313281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:34:40,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:34:40,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-04 15:34:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810762892] [2025-03-04 15:34:40,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:34:40,380 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:34:40,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash 33153, now seen corresponding path program 3 times [2025-03-04 15:34:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286542844] [2025-03-04 15:34:40,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:34:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:40,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:40,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:34:40,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:40,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:40,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:40,399 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:40,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:40,399 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:40,399 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:40,399 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:40,399 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,399 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:40,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:40,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration9_Loop [2025-03-04 15:34:40,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:40,399 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:40,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,432 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:40,432 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:40,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,434 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 15:34:40,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:40,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:40,455 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:40,455 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:40,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-04 15:34:40,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,463 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 15:34:40,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:40,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:40,481 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:34:40,482 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:34:40,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-04 15:34:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,489 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 15:34:40,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:40,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:40,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:40,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,507 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 15:34:40,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:40,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:40,548 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:40,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 15:34:40,552 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:40,552 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:40,552 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:40,552 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:40,552 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:40,552 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,552 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:40,552 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:40,552 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration9_Loop [2025-03-04 15:34:40,552 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:40,552 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:40,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,581 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:40,581 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,583 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 15:34:40,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:40,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:40,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:40,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:40,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 15:34:40,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,605 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 15:34:40,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:34:40,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:34:40,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:40,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 15:34:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,627 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 15:34:40,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:40,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:40,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:40,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:34:40,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-04 15:34:40,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,646 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 15:34:40,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:40,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:40,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:40,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:40,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:40,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:40,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:40,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:40,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:40,661 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:34:40,661 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:34:40,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,663 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-04 15:34:40,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:40,664 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:40,664 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:40,664 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-03-04 15:34:40,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-04 15:34:40,671 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:40,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:40,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:40,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:40,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:40,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:40,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 149 states and 199 transitions. cyclomatic complexity: 65 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-03-04 15:34:40,750 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 149 states and 199 transitions. cyclomatic complexity: 65. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 197 states and 258 transitions. Complement of second has 7 states. [2025-03-04 15:34:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-03-04 15:34:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-04 15:34:40,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 30 letters. Loop has 3 letters. [2025-03-04 15:34:40,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,751 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:34:40,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:34:40,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:40,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:40,817 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:40,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 149 states and 199 transitions. cyclomatic complexity: 65 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-03-04 15:34:40,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 149 states and 199 transitions. cyclomatic complexity: 65. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 271 states and 353 transitions. Complement of second has 9 states. [2025-03-04 15:34:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-03-04 15:34:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2025-03-04 15:34:40,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 30 letters. Loop has 3 letters. [2025-03-04 15:34:40,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-04 15:34:40,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 30 letters. Loop has 6 letters. [2025-03-04 15:34:40,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:40,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 353 transitions. [2025-03-04 15:34:40,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:40,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 263 states and 339 transitions. [2025-03-04 15:34:40,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:34:40,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:34:40,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 339 transitions. [2025-03-04 15:34:40,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:40,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 263 states and 339 transitions. [2025-03-04 15:34:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 339 transitions. [2025-03-04 15:34:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 227. [2025-03-04 15:34:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 227 states have (on average 1.3127753303964758) internal successors, (298), 226 states have internal predecessors, (298), 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) [2025-03-04 15:34:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 298 transitions. [2025-03-04 15:34:40,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 227 states and 298 transitions. [2025-03-04 15:34:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:34:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:34:40,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:34:40,846 INFO L87 Difference]: Start difference. First operand 227 states and 298 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2025-03-04 15:34:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:34:40,887 INFO L93 Difference]: Finished difference Result 328 states and 406 transitions. [2025-03-04 15:34:40,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 406 transitions. [2025-03-04 15:34:40,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:40,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 328 states and 406 transitions. [2025-03-04 15:34:40,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:34:40,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:34:40,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 328 states and 406 transitions. [2025-03-04 15:34:40,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:34:40,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 328 states and 406 transitions. [2025-03-04 15:34:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states and 406 transitions. [2025-03-04 15:34:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 226. [2025-03-04 15:34:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.2654867256637168) internal successors, (286), 225 states have internal predecessors, (286), 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) [2025-03-04 15:34:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 286 transitions. [2025-03-04 15:34:40,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 226 states and 286 transitions. [2025-03-04 15:34:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:34:40,894 INFO L432 stractBuchiCegarLoop]: Abstraction has 226 states and 286 transitions. [2025-03-04 15:34:40,894 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:34:40,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 286 transitions. [2025-03-04 15:34:40,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:34:40,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:34:40,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:34:40,895 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1] [2025-03-04 15:34:40,895 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:34:40,895 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~short3#1, main_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;main_~y~0#1 := 1 + main_~y~0#1;" "assume true;main_#t~short3#1 := main_~y~0#1 <= main_~m~0#1;" "assume main_#t~short3#1;havoc main_#t~nondet2#1;main_#t~short3#1 := 0 != main_#t~nondet2#1;" "assume !main_#t~short3#1;havoc main_#t~nondet2#1;havoc main_#t~short3#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2025-03-04 15:34:40,895 INFO L754 eck$LassoCheckResult]: Loop: "main_~y~0#1 := main_~y~0#1 - 1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;havoc main_#t~nondet1#1;" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2025-03-04 15:34:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash 264133903, now seen corresponding path program 3 times [2025-03-04 15:34:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104895249] [2025-03-04 15:34:40,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:34:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:40,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-03-04 15:34:40,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:34:40,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 15:34:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:40,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:34:40,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:34:40,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:40,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash 33153, now seen corresponding path program 4 times [2025-03-04 15:34:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852750520] [2025-03-04 15:34:40,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:34:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:40,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 15:34:40,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:34:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:40,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:40,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:40,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:40,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash 433021363, now seen corresponding path program 4 times [2025-03-04 15:34:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:34:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-03-04 15:34:40,915 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:34:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:34:40,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:34:40,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:34:40,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:34:40,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:34:40,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:34:40,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:34:40,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:40,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:34:40,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:34:40,950 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:40,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:40,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:40,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:40,951 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:34:40,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:40,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:40,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration10_Loop [2025-03-04 15:34:40,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:40,951 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:40,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:40,980 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:40,980 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:34:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:40,982 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:40,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-04 15:34:40,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:34:40,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:40,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-04 15:34:40,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:41,000 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:41,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-04 15:34:41,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:34:41,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:34:41,040 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:34:41,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-04 15:34:41,045 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:34:41,045 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:34:41,045 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:34:41,045 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:34:41,045 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:34:41,045 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:41,045 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:34:41,045 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:34:41,045 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration10_Loop [2025-03-04 15:34:41,045 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:34:41,045 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:34:41,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:41,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:41,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:41,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:41,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:34:41,080 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:34:41,080 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:34:41,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:41,083 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:41,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-04 15:34:41,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:34:41,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:34:41,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:34:41,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:34:41,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:34:41,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:34:41,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:34:41,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:34:41,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:34:41,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:34:41,099 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:34:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:34:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:34:41,101 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:34:41,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-04 15:34:41,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:34:41,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:34:41,102 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:34:41,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-03-04 15:34:41,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-04 15:34:41,108 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:34:41,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:41,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:34:41,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:34:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:41,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:41,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:41,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:41,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-04 15:34:41,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-04 15:34:41,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:41,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:41,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:41,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:41,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:41,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:41,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:41,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 286 transitions. cyclomatic complexity: 80 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:41,193 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 286 transitions. cyclomatic complexity: 80. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 299 states and 376 transitions. Complement of second has 7 states. [2025-03-04 15:34:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-03-04 15:34:41,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-04 15:34:41,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:41,194 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:41,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:34:41,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:34:41,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:41,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:41,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:41,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:41,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:41,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:41,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:41,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:41,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:41,253 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:41,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 286 transitions. cyclomatic complexity: 80 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:41,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 286 transitions. cyclomatic complexity: 80. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 352 states and 435 transitions. Complement of second has 9 states. [2025-03-04 15:34:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2025-03-04 15:34:41,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-04 15:34:41,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:41,272 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:34:41,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:34:41,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:34:41,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:34:41,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:41,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:41,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:34:41,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:41,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:34:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:34:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:34:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:34:41,322 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:34:41,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:34:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:34:41,333 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:34:41,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 286 transitions. cyclomatic complexity: 80 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:41,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 286 transitions. cyclomatic complexity: 80. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 380 states and 487 transitions. Complement of second has 8 states. [2025-03-04 15:34:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:34:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:34:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-03-04 15:34:41,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 33 letters. Loop has 3 letters. [2025-03-04 15:34:41,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:41,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 36 letters. Loop has 3 letters. [2025-03-04 15:34:41,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:41,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 33 letters. Loop has 6 letters. [2025-03-04 15:34:41,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:34:41,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 380 states and 487 transitions. [2025-03-04 15:34:41,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:34:41,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 380 states to 0 states and 0 transitions. [2025-03-04 15:34:41,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:34:41,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:34:41,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:34:41,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:34:41,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:34:41,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:34:41,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:34:41,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:34:41,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:34:41,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:34:41,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:34:41,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:34:41 BoogieIcfgContainer [2025-03-04 15:34:41,362 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:34:41,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:34:41,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:34:41,363 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:34:41,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:34:34" (3/4) ... [2025-03-04 15:34:41,364 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:34:41,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:34:41,365 INFO L158 Benchmark]: Toolchain (without parser) took 7004.00ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 83.0MB in the end (delta: 23.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-03-04 15:34:41,366 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:41,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.45ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:34:41,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.09ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 95.0MB in the end (delta: 794.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:41,366 INFO L158 Benchmark]: Boogie Preprocessor took 17.07ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 94.3MB in the end (delta: 758.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:41,367 INFO L158 Benchmark]: IcfgBuilder took 173.20ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 84.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:34:41,367 INFO L158 Benchmark]: BuchiAutomizer took 6637.97ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2025-03-04 15:34:41,367 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 83.0MB in the end (delta: 317.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:34:41,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.45ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.09ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 95.0MB in the end (delta: 794.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.07ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 94.3MB in the end (delta: 758.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 173.20ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 84.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6637.97ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 83.0MB in the end (delta: 317.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (5 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long) 2 * y) + 1) and consists of 4 locations. One deterministic module has affine ranking function ((((long) 2 * m) + ((long) -2 * y)) + 1) and consists of 6 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function ((((long) 2 * m) + ((long) -2 * y)) + 1) and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 11 iterations. TraceHistogramMax:6. Analysis of lassos took 4.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 520 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 2, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 415 IncrementalHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 280 mSDtfsCounter, 415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax182 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:34:41,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:41,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:41,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:34:41,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE