./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:34:30,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:34:30,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:34:30,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:34:30,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:34:30,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:34:30,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:34:30,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:34:30,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:34:30,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:34:30,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:34:30,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:34:30,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:34:30,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:34:30,671 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:34:30,671 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:34:30,673 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:34:30,673 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:34:30,673 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:34:30,673 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:34:30,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:34:30,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:34:30,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:34:30,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:34:30,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:34:30,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:34:30,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:34:30,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:34:30,678 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:34:30,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:34:30,678 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:34:30,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:34:30,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:34:30,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:34:30,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:34:30,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:34:30,680 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:34:30,680 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2024-11-10 22:34:30,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:34:30,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:34:30,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:34:30,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:34:30,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:34:30,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2024-11-10 22:34:32,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:34:32,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:34:32,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2024-11-10 22:34:32,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970cfc49/99f394ce657749a9b246643a7db06c4c/FLAG972b5a65b [2024-11-10 22:34:32,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5970cfc49/99f394ce657749a9b246643a7db06c4c [2024-11-10 22:34:32,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:34:32,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:34:32,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:34:32,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:34:32,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:34:32,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:34:32" (1/1) ... [2024-11-10 22:34:32,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b6fa87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:32, skipping insertion in model container [2024-11-10 22:34:32,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:34:32" (1/1) ... [2024-11-10 22:34:32,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:34:33,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:34:33,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:34:33,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:34:33,145 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:34:33,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33 WrapperNode [2024-11-10 22:34:33,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:34:33,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:34:33,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:34:33,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:34:33,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,171 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2024-11-10 22:34:33,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:34:33,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:34:33,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:34:33,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:34:33,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,188 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 22:34:33,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:34:33,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:34:33,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:34:33,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:34:33,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (1/1) ... [2024-11-10 22:34:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:34:33,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:34:33,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:34:33,335 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:34:33,337 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:34:33,382 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-10 22:34:33,382 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:34:33,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:34:33,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:34:33,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:33 BoogieIcfgContainer [2024-11-10 22:34:33,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:34:33,398 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:34:33,398 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:34:33,402 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:34:33,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:33,402 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:34:32" (1/3) ... [2024-11-10 22:34:33,403 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1542d434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:34:33, skipping insertion in model container [2024-11-10 22:34:33,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:33,403 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:34:33" (2/3) ... [2024-11-10 22:34:33,404 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1542d434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:34:33, skipping insertion in model container [2024-11-10 22:34:33,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:34:33,404 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:33" (3/3) ... [2024-11-10 22:34:33,405 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2024-11-10 22:34:33,448 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:34:33,448 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:34:33,448 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:34:33,448 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:34:33,448 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:34:33,449 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:34:33,449 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:34:33,449 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:34:33,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:33,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:33,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:33,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:33,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:33,471 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:34:33,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:33,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:33,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:33,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:33,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:34:33,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:33,479 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 5#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2#L9true [2024-11-10 22:34:33,479 INFO L747 eck$LassoCheckResult]: Loop: 2#L9true assume true; 6#L9-1true assume !!(main_~i~0#1 < 100); 7#L10true assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2#L9true [2024-11-10 22:34:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 1 times [2024-11-10 22:34:33,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913528151] [2024-11-10 22:34:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:33,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 36707, now seen corresponding path program 1 times [2024-11-10 22:34:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634194712] [2024-11-10 22:34:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:33,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash 38139396, now seen corresponding path program 1 times [2024-11-10 22:34:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:33,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767962520] [2024-11-10 22:34:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:33,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:33,685 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:33,686 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:33,686 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:33,686 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:33,686 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:33,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,687 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:33,687 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:33,687 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2024-11-10 22:34:33,687 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:33,687 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:33,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,795 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:33,796 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:33,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:34:33,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:33,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,831 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:33,832 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: [] [2024-11-10 22:34:33,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:33,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:34:33,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:33,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,875 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:33,876 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: [] [2024-11-10 22:34:33,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:34:33,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,888 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:34:33,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:33,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:34:33,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:33,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:33,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:34:33,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:33,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:33,955 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:33,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 22:34:33,960 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:33,960 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:33,960 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:33,960 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:33,960 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:33,961 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:33,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:33,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:33,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2024-11-10 22:34:33,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:33,961 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:33,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:33,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,019 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:34,023 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:34,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:34:34,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:34,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:34,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:34,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:34,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:34,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:34,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:34,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:34,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:34,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:34:34,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:34,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:34,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:34,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:34,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:34,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:34,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:34,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:34,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:34:34,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:34:34,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:34,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:34,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:34,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:34,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:34,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:34,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:34,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:34,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:34,147 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:34,147 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:34:34,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:34,189 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:34,189 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:34,190 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-10 22:34:34,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:34:34,209 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,270 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:34,308 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:34,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 19 states and 25 transitions. Complement of second has 6 states. [2024-11-10 22:34:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-10 22:34:34,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-10 22:34:34,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-10 22:34:34,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-10 22:34:34,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:34,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2024-11-10 22:34:34,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:34,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2024-11-10 22:34:34,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-10 22:34:34,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-10 22:34:34,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-11-10 22:34:34,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:34,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:34:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-11-10 22:34:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-10 22:34:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 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) [2024-11-10 22:34:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-10 22:34:34,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:34:34,388 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-11-10 22:34:34,389 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:34:34,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-11-10 22:34:34,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:34,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:34,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:34,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:34:34,392 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:34,393 INFO L745 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 72#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 75#L9 assume true; 70#L9-1 assume !!(main_~i~0#1 < 100); 73#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 66#L9 [2024-11-10 22:34:34,393 INFO L747 eck$LassoCheckResult]: Loop: 66#L9 assume true; 67#L9-1 assume !!(main_~i~0#1 < 100); 76#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 66#L9 [2024-11-10 22:34:34,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash 38139397, now seen corresponding path program 1 times [2024-11-10 22:34:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698277088] [2024-11-10 22:34:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 22:34:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698277088] [2024-11-10 22:34:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698277088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:34:34,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:34:34,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:34:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744200151] [2024-11-10 22:34:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:34:34,487 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:34:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 36707, now seen corresponding path program 2 times [2024-11-10 22:34:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105085349] [2024-11-10 22:34:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:34,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:34,590 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:34,591 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:34,591 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:34,591 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:34,591 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:34,591 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,591 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:34,593 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:34,593 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2024-11-10 22:34:34,593 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:34,593 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:34,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,645 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:34,645 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:34:34,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:34,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:34,673 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:34,673 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: [] [2024-11-10 22:34:34,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:34,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,686 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:34:34,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:34,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:34,708 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:34,708 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: [] [2024-11-10 22:34:34,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:34,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:34:34,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:34,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:34,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 22:34:34,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,749 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:34:34,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:34,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:34,786 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:34,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-10 22:34:34,793 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:34,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:34,794 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:34,794 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:34,794 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:34,794 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,794 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:34,794 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:34,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2024-11-10 22:34:34,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:34,794 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:34,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:34,843 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:34,843 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,846 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:34:34,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:34,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:34,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:34,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:34,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:34,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:34,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:34,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:34,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 22:34:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:34:34,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 [2024-11-10 22:34:34,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:34,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:34,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:34,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:34,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:34,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:34,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:34,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-10 22:34:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 22:34:34,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:34,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:34,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:34,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:34,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:34,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:34,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:34,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:34,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:34,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:34,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:34,953 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:34,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:34:34,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:34,957 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:34,957 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:34,957 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-10 22:34:34,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-10 22:34:34,974 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:34,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:34,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:34,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,003 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,010 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:35,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 17 states and 22 transitions. Complement of second has 5 states. [2024-11-10 22:34:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:34:35,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-10 22:34:35,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-10 22:34:35,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-10 22:34:35,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2024-11-10 22:34:35,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:35,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2024-11-10 22:34:35,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 22:34:35,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:34:35,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-11-10 22:34:35,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:35,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:34:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-11-10 22:34:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-10 22:34:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-10 22:34:35,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-10 22:34:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:34:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:34:35,031 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:35,042 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-11-10 22:34:35,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2024-11-10 22:34:35,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:35,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2024-11-10 22:34:35,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-10 22:34:35,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:34:35,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-11-10 22:34:35,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:35,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-10 22:34:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-11-10 22:34:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-10 22:34:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-10 22:34:35,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-10 22:34:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:34:35,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-10 22:34:35,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:34:35,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-10 22:34:35,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:34:35,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:35,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:35,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2024-11-10 22:34:35,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:35,053 INFO L745 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 180#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 183#L9 assume true; 178#L9-1 assume !!(main_~i~0#1 < 100); 182#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 176#L9 assume true; 177#L9-1 assume !!(main_~i~0#1 < 100); 181#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 184#L9 assume true; 186#L9-1 assume !!(main_~i~0#1 < 100); 188#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 174#L9 [2024-11-10 22:34:35,054 INFO L747 eck$LassoCheckResult]: Loop: 174#L9 assume true; 175#L9-1 assume !!(main_~i~0#1 < 100); 187#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 174#L9 [2024-11-10 22:34:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1755920156, now seen corresponding path program 1 times [2024-11-10 22:34:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548534087] [2024-11-10 22:34:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548534087] [2024-11-10 22:34:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548534087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079221969] [2024-11-10 22:34:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:35,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:35,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,112 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 22:34:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079221969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:35,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:35,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 22:34:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64013653] [2024-11-10 22:34:35,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:35,227 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:34:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash 36707, now seen corresponding path program 3 times [2024-11-10 22:34:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375742009] [2024-11-10 22:34:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:35,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:35,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:35,257 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:35,258 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:35,258 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:35,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:35,258 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:35,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:35,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:35,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:35,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2024-11-10 22:34:35,259 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:35,259 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:35,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:35,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:35,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:35,315 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:35,316 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,319 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:34:35,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:35,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:35,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:35,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:35,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,347 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 22:34:35,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:35,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:35,375 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:35,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-10 22:34:35,380 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:35,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:35,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:35,380 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:35,380 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:35,380 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:35,380 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:35,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:35,380 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2024-11-10 22:34:35,380 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:35,380 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:35,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:35,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:35,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:35,429 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:35,429 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:35,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:35,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,431 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 22:34:35,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:35,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:35,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:35,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:35,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:35,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:35,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:35,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:35,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:35,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:35,450 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:34:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,453 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 22:34:35,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:35,455 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:35,455 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:35,455 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-10 22:34:35,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-10 22:34:35,471 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,515 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,523 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:35,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-10 22:34:35,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 21 states and 27 transitions. Complement of second has 5 states. [2024-11-10 22:34:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-10 22:34:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:34:35,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-10 22:34:35,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,540 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:35,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,584 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,589 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:34:35,589 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-10 22:34:35,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 21 states and 27 transitions. Complement of second has 5 states. [2024-11-10 22:34:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-10 22:34:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-10 22:34:35,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-10 22:34:35,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,599 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,636 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,643 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 1 loop predicates [2024-11-10 22:34:35,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-10 22:34:35,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 24 states and 31 transitions. Complement of second has 4 states. [2024-11-10 22:34:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-10 22:34:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-10 22:34:35,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-10 22:34:35,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-10 22:34:35,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-10 22:34:35,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:35,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-11-10 22:34:35,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:34:35,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2024-11-10 22:34:35,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-10 22:34:35,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:34:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2024-11-10 22:34:35,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:35,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-10 22:34:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2024-11-10 22:34:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2024-11-10 22:34:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-11-10 22:34:35,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-11-10 22:34:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:35,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 22:34:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 22:34:35,667 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:35,694 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-10 22:34:35,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2024-11-10 22:34:35,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:34:35,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 22 transitions. [2024-11-10 22:34:35,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-10 22:34:35,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-10 22:34:35,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-11-10 22:34:35,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:35,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 22:34:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-11-10 22:34:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-10 22:34:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-10 22:34:35,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 22:34:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:34:35,699 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-10 22:34:35,699 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:34:35,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2024-11-10 22:34:35,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-10 22:34:35,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:35,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:35,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1] [2024-11-10 22:34:35,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:34:35,701 INFO L745 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 511#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 506#L9 assume true; 507#L9-1 assume !!(main_~i~0#1 < 100); 514#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 508#L9 assume true; 509#L9-1 assume !!(main_~i~0#1 < 100); 523#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 522#L9 assume true; 521#L9-1 assume !!(main_~i~0#1 < 100); 520#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 519#L9 assume true; 517#L9-1 assume !!(main_~i~0#1 < 100); 518#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 516#L9 assume true; 512#L9-1 [2024-11-10 22:34:35,701 INFO L747 eck$LassoCheckResult]: Loop: 512#L9-1 assume !!(main_~i~0#1 < 100); 513#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 515#L9 assume true; 512#L9-1 [2024-11-10 22:34:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1554794489, now seen corresponding path program 2 times [2024-11-10 22:34:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922631680] [2024-11-10 22:34:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:35,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:35,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:35,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash 35688, now seen corresponding path program 1 times [2024-11-10 22:34:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:35,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640862963] [2024-11-10 22:34:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:35,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:35,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:35,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1955295838, now seen corresponding path program 2 times [2024-11-10 22:34:35,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:35,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174685695] [2024-11-10 22:34:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:35,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174685695] [2024-11-10 22:34:35,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174685695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:35,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949220002] [2024-11-10 22:34:35,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:34:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:35,841 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:35,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-10 22:34:35,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:34:35,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:35,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:34:35,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:35,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949220002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:36,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 22:34:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390547344] [2024-11-10 22:34:36,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:36,029 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:36,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:36,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:36,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:36,029 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:34:36,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:36,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:36,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2024-11-10 22:34:36,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:36,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:36,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:36,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:36,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:36,076 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:36,076 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:34:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,080 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) [2024-11-10 22:34:36,081 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 [2024-11-10 22:34:36,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:36,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:36,103 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:36,103 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:36,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:36,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,124 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 22:34:36,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:36,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:36,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-10 22:34:36,149 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 22:34:36,149 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 22:34:36,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 22:34:36,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:36,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,162 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 22:34:36,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:34:36,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:36,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:36,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,196 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 22:34:36,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:34:36,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:34:36,210 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:34:36,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-10 22:34:36,222 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:34:36,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:34:36,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:34:36,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:34:36,223 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:34:36,229 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,230 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:34:36,230 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:34:36,230 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2024-11-10 22:34:36,230 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:34:36,230 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:34:36,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:36,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:36,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:34:36,278 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:34:36,279 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:34:36,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,281 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 22:34:36,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:36,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:36,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:36,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:36,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:36,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:36,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:36,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:36,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,319 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 22:34:36,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:36,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:36,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:36,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:36,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:36,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:34:36,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:34:36,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:34:36,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:36,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,363 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:34:36,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-10 22:34:36,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:34:36,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:34:36,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:34:36,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:34:36,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:34:36,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:34:36,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:34:36,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:34:36,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:34:36,388 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:34:36,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:34:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,390 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 22:34:36,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:34:36,392 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:34:36,392 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:34:36,392 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-10 22:34:36,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:36,407 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:34:36,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,455 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:36,471 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:34:36,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,478 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 19 states and 21 transitions. Complement of second has 5 states. [2024-11-10 22:34:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2024-11-10 22:34:36,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:34:36,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:36,481 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:36,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,518 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:36,533 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-10 22:34:36,533 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 19 states and 21 transitions. Complement of second has 5 states. [2024-11-10 22:34:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2024-11-10 22:34:36,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:34:36,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:36,541 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:34:36,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,583 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:34:36,601 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 2 loop predicates [2024-11-10 22:34:36,602 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 20 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 29 states and 31 transitions. Complement of second has 6 states. [2024-11-10 22:34:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:34:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-10 22:34:36,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-10 22:34:36,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:36,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 3 letters. [2024-11-10 22:34:36,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:36,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-10 22:34:36,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:34:36,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2024-11-10 22:34:36,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-10 22:34:36,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 22 transitions. [2024-11-10 22:34:36,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:36,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:36,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-11-10 22:34:36,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:36,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 22:34:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-11-10 22:34:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-10 22:34:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-10 22:34:36,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-10 22:34:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 22:34:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-10 22:34:36,616 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:36,657 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-11-10 22:34:36,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2024-11-10 22:34:36,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:36,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 41 transitions. [2024-11-10 22:34:36,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:36,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:36,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2024-11-10 22:34:36,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:36,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-10 22:34:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2024-11-10 22:34:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-10 22:34:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.054054054054054) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-10 22:34:36,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-10 22:34:36,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 22:34:36,662 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-10 22:34:36,663 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:34:36,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2024-11-10 22:34:36,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:36,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:36,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:36,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1] [2024-11-10 22:34:36,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:36,665 INFO L745 eck$LassoCheckResult]: Stem: 970#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 971#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 966#L9 assume true; 967#L9-1 assume !!(main_~i~0#1 < 100); 1002#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 968#L9 assume true; 969#L9-1 assume !!(main_~i~0#1 < 100); 974#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 975#L9 assume true; 1001#L9-1 assume !!(main_~i~0#1 < 100); 1000#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 999#L9 assume true; 998#L9-1 assume !!(main_~i~0#1 < 100); 997#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 996#L9 assume true; 995#L9-1 assume !!(main_~i~0#1 < 100); 994#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 993#L9 assume true; 992#L9-1 assume !!(main_~i~0#1 < 100); 991#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 990#L9 assume true; 989#L9-1 assume !!(main_~i~0#1 < 100); 988#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 987#L9 assume true; 986#L9-1 assume !!(main_~i~0#1 < 100); 985#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 984#L9 assume true; 982#L9-1 assume !!(main_~i~0#1 < 100); 980#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 979#L9 assume true; 977#L9-1 assume !!(main_~i~0#1 < 100); 978#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 976#L9 assume true; 972#L9-1 [2024-11-10 22:34:36,665 INFO L747 eck$LassoCheckResult]: Loop: 972#L9-1 assume !!(main_~i~0#1 < 100); 973#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 981#L9 assume true; 977#L9-1 assume !!(main_~i~0#1 < 100); 978#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 976#L9 assume true; 972#L9-1 [2024-11-10 22:34:36,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1912984455, now seen corresponding path program 3 times [2024-11-10 22:34:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723152688] [2024-11-10 22:34:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:36,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 1 times [2024-11-10 22:34:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217783912] [2024-11-10 22:34:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:36,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash -855799416, now seen corresponding path program 3 times [2024-11-10 22:34:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:36,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976460826] [2024-11-10 22:34:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976460826] [2024-11-10 22:34:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976460826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97313216] [2024-11-10 22:34:36,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:34:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:36,915 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:36,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-10 22:34:36,955 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-10 22:34:36,955 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:36,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:34:36,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:37,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 44 proven. 165 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97313216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:37,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-10 22:34:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970072312] [2024-11-10 22:34:37,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 22:34:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-10 22:34:37,286 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:37,351 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2024-11-10 22:34:37,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 101 transitions. [2024-11-10 22:34:37,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:37,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 75 states and 77 transitions. [2024-11-10 22:34:37,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:37,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:37,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2024-11-10 22:34:37,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:37,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-10 22:34:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2024-11-10 22:34:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-10 22:34:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-10 22:34:37,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-10 22:34:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 22:34:37,359 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-10 22:34:37,359 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:34:37,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2024-11-10 22:34:37,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:37,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:37,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:37,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 22, 1, 1] [2024-11-10 22:34:37,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:37,362 INFO L745 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1364#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1359#L9 assume true; 1360#L9-1 assume !!(main_~i~0#1 < 100); 1431#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1361#L9 assume true; 1362#L9-1 assume !!(main_~i~0#1 < 100); 1367#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1368#L9 assume true; 1430#L9-1 assume !!(main_~i~0#1 < 100); 1429#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1428#L9 assume true; 1427#L9-1 assume !!(main_~i~0#1 < 100); 1426#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1425#L9 assume true; 1424#L9-1 assume !!(main_~i~0#1 < 100); 1423#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1422#L9 assume true; 1421#L9-1 assume !!(main_~i~0#1 < 100); 1420#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1419#L9 assume true; 1418#L9-1 assume !!(main_~i~0#1 < 100); 1417#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1416#L9 assume true; 1415#L9-1 assume !!(main_~i~0#1 < 100); 1414#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1413#L9 assume true; 1412#L9-1 assume !!(main_~i~0#1 < 100); 1411#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1410#L9 assume true; 1409#L9-1 assume !!(main_~i~0#1 < 100); 1408#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1407#L9 assume true; 1406#L9-1 assume !!(main_~i~0#1 < 100); 1405#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1404#L9 assume true; 1403#L9-1 assume !!(main_~i~0#1 < 100); 1402#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1401#L9 assume true; 1400#L9-1 assume !!(main_~i~0#1 < 100); 1399#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1398#L9 assume true; 1397#L9-1 assume !!(main_~i~0#1 < 100); 1396#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1395#L9 assume true; 1394#L9-1 assume !!(main_~i~0#1 < 100); 1393#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1392#L9 assume true; 1391#L9-1 assume !!(main_~i~0#1 < 100); 1390#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1389#L9 assume true; 1388#L9-1 assume !!(main_~i~0#1 < 100); 1387#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1386#L9 assume true; 1385#L9-1 assume !!(main_~i~0#1 < 100); 1384#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1383#L9 assume true; 1382#L9-1 assume !!(main_~i~0#1 < 100); 1381#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1380#L9 assume true; 1379#L9-1 assume !!(main_~i~0#1 < 100); 1378#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1377#L9 assume true; 1375#L9-1 assume !!(main_~i~0#1 < 100); 1373#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1372#L9 assume true; 1370#L9-1 assume !!(main_~i~0#1 < 100); 1371#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1369#L9 assume true; 1365#L9-1 [2024-11-10 22:34:37,362 INFO L747 eck$LassoCheckResult]: Loop: 1365#L9-1 assume !!(main_~i~0#1 < 100); 1366#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1374#L9 assume true; 1370#L9-1 assume !!(main_~i~0#1 < 100); 1371#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1369#L9 assume true; 1365#L9-1 [2024-11-10 22:34:37,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash -358454649, now seen corresponding path program 4 times [2024-11-10 22:34:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:37,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541008279] [2024-11-10 22:34:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:37,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:37,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 2 times [2024-11-10 22:34:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:37,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316530797] [2024-11-10 22:34:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:37,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:37,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:37,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 764207240, now seen corresponding path program 4 times [2024-11-10 22:34:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671028115] [2024-11-10 22:34:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:37,474 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 [2024-11-10 22:34:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 92 proven. 759 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671028115] [2024-11-10 22:34:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671028115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:37,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361022940] [2024-11-10 22:34:37,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:34:37,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:37,995 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-10 22:34:38,035 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:34:38,036 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:38,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:34:38,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 92 proven. 759 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:38,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 92 proven. 759 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361022940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:38,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:38,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-10 22:34:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742758391] [2024-11-10 22:34:38,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:38,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 22:34:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 22:34:39,001 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 3.0) internal successors, (144), 48 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:39,151 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2024-11-10 22:34:39,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 197 transitions. [2024-11-10 22:34:39,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:39,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 147 states and 149 transitions. [2024-11-10 22:34:39,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:39,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:39,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 149 transitions. [2024-11-10 22:34:39,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:39,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 149 transitions. [2024-11-10 22:34:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 149 transitions. [2024-11-10 22:34:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-10 22:34:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 145 states have (on average 1.013793103448276) internal successors, (147), 144 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2024-11-10 22:34:39,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 145 states and 147 transitions. [2024-11-10 22:34:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 22:34:39,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 145 states and 147 transitions. [2024-11-10 22:34:39,173 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:34:39,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 147 transitions. [2024-11-10 22:34:39,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:39,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:39,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:39,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 46, 1, 1] [2024-11-10 22:34:39,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:39,183 INFO L745 eck$LassoCheckResult]: Stem: 2128#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2129#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2124#L9 assume true; 2125#L9-1 assume !!(main_~i~0#1 < 100); 2268#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2126#L9 assume true; 2127#L9-1 assume !!(main_~i~0#1 < 100); 2132#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2133#L9 assume true; 2267#L9-1 assume !!(main_~i~0#1 < 100); 2266#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2265#L9 assume true; 2264#L9-1 assume !!(main_~i~0#1 < 100); 2263#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2262#L9 assume true; 2261#L9-1 assume !!(main_~i~0#1 < 100); 2260#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2259#L9 assume true; 2258#L9-1 assume !!(main_~i~0#1 < 100); 2257#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2256#L9 assume true; 2255#L9-1 assume !!(main_~i~0#1 < 100); 2254#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2253#L9 assume true; 2252#L9-1 assume !!(main_~i~0#1 < 100); 2251#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2250#L9 assume true; 2249#L9-1 assume !!(main_~i~0#1 < 100); 2248#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2247#L9 assume true; 2246#L9-1 assume !!(main_~i~0#1 < 100); 2245#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2244#L9 assume true; 2243#L9-1 assume !!(main_~i~0#1 < 100); 2242#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2241#L9 assume true; 2240#L9-1 assume !!(main_~i~0#1 < 100); 2239#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2238#L9 assume true; 2237#L9-1 assume !!(main_~i~0#1 < 100); 2236#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2235#L9 assume true; 2234#L9-1 assume !!(main_~i~0#1 < 100); 2233#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2232#L9 assume true; 2231#L9-1 assume !!(main_~i~0#1 < 100); 2230#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2229#L9 assume true; 2228#L9-1 assume !!(main_~i~0#1 < 100); 2227#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2226#L9 assume true; 2225#L9-1 assume !!(main_~i~0#1 < 100); 2224#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2223#L9 assume true; 2222#L9-1 assume !!(main_~i~0#1 < 100); 2221#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2220#L9 assume true; 2219#L9-1 assume !!(main_~i~0#1 < 100); 2218#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2217#L9 assume true; 2216#L9-1 assume !!(main_~i~0#1 < 100); 2215#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2214#L9 assume true; 2213#L9-1 assume !!(main_~i~0#1 < 100); 2212#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2211#L9 assume true; 2210#L9-1 assume !!(main_~i~0#1 < 100); 2209#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2208#L9 assume true; 2207#L9-1 assume !!(main_~i~0#1 < 100); 2206#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2205#L9 assume true; 2204#L9-1 assume !!(main_~i~0#1 < 100); 2203#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2202#L9 assume true; 2201#L9-1 assume !!(main_~i~0#1 < 100); 2200#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2199#L9 assume true; 2198#L9-1 assume !!(main_~i~0#1 < 100); 2197#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2196#L9 assume true; 2195#L9-1 assume !!(main_~i~0#1 < 100); 2194#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2193#L9 assume true; 2192#L9-1 assume !!(main_~i~0#1 < 100); 2191#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2190#L9 assume true; 2189#L9-1 assume !!(main_~i~0#1 < 100); 2188#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2187#L9 assume true; 2186#L9-1 assume !!(main_~i~0#1 < 100); 2185#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2184#L9 assume true; 2183#L9-1 assume !!(main_~i~0#1 < 100); 2182#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2181#L9 assume true; 2180#L9-1 assume !!(main_~i~0#1 < 100); 2179#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2178#L9 assume true; 2177#L9-1 assume !!(main_~i~0#1 < 100); 2176#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2175#L9 assume true; 2174#L9-1 assume !!(main_~i~0#1 < 100); 2173#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2172#L9 assume true; 2171#L9-1 assume !!(main_~i~0#1 < 100); 2170#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2169#L9 assume true; 2168#L9-1 assume !!(main_~i~0#1 < 100); 2167#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2166#L9 assume true; 2165#L9-1 assume !!(main_~i~0#1 < 100); 2164#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2163#L9 assume true; 2162#L9-1 assume !!(main_~i~0#1 < 100); 2161#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2160#L9 assume true; 2159#L9-1 assume !!(main_~i~0#1 < 100); 2158#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2157#L9 assume true; 2156#L9-1 assume !!(main_~i~0#1 < 100); 2155#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2154#L9 assume true; 2153#L9-1 assume !!(main_~i~0#1 < 100); 2152#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2151#L9 assume true; 2150#L9-1 assume !!(main_~i~0#1 < 100); 2149#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2148#L9 assume true; 2147#L9-1 assume !!(main_~i~0#1 < 100); 2146#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2145#L9 assume true; 2144#L9-1 assume !!(main_~i~0#1 < 100); 2143#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2142#L9 assume true; 2140#L9-1 assume !!(main_~i~0#1 < 100); 2138#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2137#L9 assume true; 2135#L9-1 assume !!(main_~i~0#1 < 100); 2136#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2134#L9 assume true; 2130#L9-1 [2024-11-10 22:34:39,183 INFO L747 eck$LassoCheckResult]: Loop: 2130#L9-1 assume !!(main_~i~0#1 < 100); 2131#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2139#L9 assume true; 2135#L9-1 assume !!(main_~i~0#1 < 100); 2136#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2134#L9 assume true; 2130#L9-1 [2024-11-10 22:34:39,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2065885049, now seen corresponding path program 5 times [2024-11-10 22:34:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:39,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694340308] [2024-11-10 22:34:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:39,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 3 times [2024-11-10 22:34:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003531752] [2024-11-10 22:34:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:39,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 814550664, now seen corresponding path program 5 times [2024-11-10 22:34:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092858454] [2024-11-10 22:34:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:34:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 188 proven. 3243 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:34:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092858454] [2024-11-10 22:34:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092858454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:34:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979590872] [2024-11-10 22:34:40,836 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 22:34:40,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:34:40,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:34:40,838 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:34:40,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-10 22:34:40,911 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2024-11-10 22:34:40,911 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:34:40,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 22:34:40,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:34:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 188 proven. 3243 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:41,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:34:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 188 proven. 3243 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 22:34:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979590872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:34:42,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:34:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2024-11-10 22:34:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687191946] [2024-11-10 22:34:42,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:34:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:34:42,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 22:34:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 22:34:42,394 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 3.019230769230769) internal successors, (157), 52 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:34:42,515 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2024-11-10 22:34:42,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 169 transitions. [2024-11-10 22:34:42,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:42,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 159 states and 161 transitions. [2024-11-10 22:34:42,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-10 22:34:42,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-11-10 22:34:42,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 161 transitions. [2024-11-10 22:34:42,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:34:42,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 161 transitions. [2024-11-10 22:34:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 161 transitions. [2024-11-10 22:34:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-10 22:34:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 156 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:34:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2024-11-10 22:34:42,524 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 159 transitions. [2024-11-10 22:34:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-10 22:34:42,525 INFO L425 stractBuchiCegarLoop]: Abstraction has 157 states and 159 transitions. [2024-11-10 22:34:42,525 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:34:42,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 159 transitions. [2024-11-10 22:34:42,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:34:42,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:34:42,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:34:42,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 50, 50, 1, 1] [2024-11-10 22:34:42,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2024-11-10 22:34:42,529 INFO L745 eck$LassoCheckResult]: Stem: 3373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3374#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 3369#L9 assume true; 3370#L9-1 assume !!(main_~i~0#1 < 100); 3525#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3371#L9 assume true; 3372#L9-1 assume !!(main_~i~0#1 < 100); 3377#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3378#L9 assume true; 3524#L9-1 assume !!(main_~i~0#1 < 100); 3523#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3522#L9 assume true; 3521#L9-1 assume !!(main_~i~0#1 < 100); 3520#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3519#L9 assume true; 3518#L9-1 assume !!(main_~i~0#1 < 100); 3517#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3516#L9 assume true; 3515#L9-1 assume !!(main_~i~0#1 < 100); 3514#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3513#L9 assume true; 3512#L9-1 assume !!(main_~i~0#1 < 100); 3511#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3510#L9 assume true; 3509#L9-1 assume !!(main_~i~0#1 < 100); 3508#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3507#L9 assume true; 3506#L9-1 assume !!(main_~i~0#1 < 100); 3505#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3504#L9 assume true; 3503#L9-1 assume !!(main_~i~0#1 < 100); 3502#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3501#L9 assume true; 3500#L9-1 assume !!(main_~i~0#1 < 100); 3499#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3498#L9 assume true; 3497#L9-1 assume !!(main_~i~0#1 < 100); 3496#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3495#L9 assume true; 3494#L9-1 assume !!(main_~i~0#1 < 100); 3493#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3492#L9 assume true; 3491#L9-1 assume !!(main_~i~0#1 < 100); 3490#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3489#L9 assume true; 3488#L9-1 assume !!(main_~i~0#1 < 100); 3487#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3486#L9 assume true; 3485#L9-1 assume !!(main_~i~0#1 < 100); 3484#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3483#L9 assume true; 3482#L9-1 assume !!(main_~i~0#1 < 100); 3481#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3480#L9 assume true; 3479#L9-1 assume !!(main_~i~0#1 < 100); 3478#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3477#L9 assume true; 3476#L9-1 assume !!(main_~i~0#1 < 100); 3475#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3474#L9 assume true; 3473#L9-1 assume !!(main_~i~0#1 < 100); 3472#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3471#L9 assume true; 3470#L9-1 assume !!(main_~i~0#1 < 100); 3469#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3468#L9 assume true; 3467#L9-1 assume !!(main_~i~0#1 < 100); 3466#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3465#L9 assume true; 3464#L9-1 assume !!(main_~i~0#1 < 100); 3463#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3462#L9 assume true; 3461#L9-1 assume !!(main_~i~0#1 < 100); 3460#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3459#L9 assume true; 3458#L9-1 assume !!(main_~i~0#1 < 100); 3457#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3456#L9 assume true; 3455#L9-1 assume !!(main_~i~0#1 < 100); 3454#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3453#L9 assume true; 3452#L9-1 assume !!(main_~i~0#1 < 100); 3451#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3450#L9 assume true; 3449#L9-1 assume !!(main_~i~0#1 < 100); 3448#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3447#L9 assume true; 3446#L9-1 assume !!(main_~i~0#1 < 100); 3445#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3444#L9 assume true; 3443#L9-1 assume !!(main_~i~0#1 < 100); 3442#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3441#L9 assume true; 3440#L9-1 assume !!(main_~i~0#1 < 100); 3439#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3438#L9 assume true; 3437#L9-1 assume !!(main_~i~0#1 < 100); 3436#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3435#L9 assume true; 3434#L9-1 assume !!(main_~i~0#1 < 100); 3433#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3432#L9 assume true; 3431#L9-1 assume !!(main_~i~0#1 < 100); 3430#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3429#L9 assume true; 3428#L9-1 assume !!(main_~i~0#1 < 100); 3427#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3426#L9 assume true; 3425#L9-1 assume !!(main_~i~0#1 < 100); 3424#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3423#L9 assume true; 3422#L9-1 assume !!(main_~i~0#1 < 100); 3421#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3420#L9 assume true; 3419#L9-1 assume !!(main_~i~0#1 < 100); 3418#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3417#L9 assume true; 3416#L9-1 assume !!(main_~i~0#1 < 100); 3415#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3414#L9 assume true; 3413#L9-1 assume !!(main_~i~0#1 < 100); 3412#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3411#L9 assume true; 3410#L9-1 assume !!(main_~i~0#1 < 100); 3409#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3408#L9 assume true; 3407#L9-1 assume !!(main_~i~0#1 < 100); 3406#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3405#L9 assume true; 3404#L9-1 assume !!(main_~i~0#1 < 100); 3403#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3402#L9 assume true; 3401#L9-1 assume !!(main_~i~0#1 < 100); 3400#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3399#L9 assume true; 3398#L9-1 assume !!(main_~i~0#1 < 100); 3397#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3396#L9 assume true; 3395#L9-1 assume !!(main_~i~0#1 < 100); 3394#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3393#L9 assume true; 3392#L9-1 assume !!(main_~i~0#1 < 100); 3391#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3390#L9 assume true; 3389#L9-1 assume !!(main_~i~0#1 < 100); 3388#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3387#L9 assume true; 3385#L9-1 assume !!(main_~i~0#1 < 100); 3383#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3382#L9 assume true; 3380#L9-1 assume !!(main_~i~0#1 < 100); 3381#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3379#L9 assume true; 3375#L9-1 [2024-11-10 22:34:42,529 INFO L747 eck$LassoCheckResult]: Loop: 3375#L9-1 assume !!(main_~i~0#1 < 100); 3376#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 3384#L9 assume true; 3380#L9-1 assume !!(main_~i~0#1 < 100); 3381#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 3379#L9 assume true; 3375#L9-1 [2024-11-10 22:34:42,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -102763129, now seen corresponding path program 6 times [2024-11-10 22:34:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:42,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510833026] [2024-11-10 22:34:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:42,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:42,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1063187074, now seen corresponding path program 4 times [2024-11-10 22:34:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533249445] [2024-11-10 22:34:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:42,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:42,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:42,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:34:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 490089352, now seen corresponding path program 6 times [2024-11-10 22:34:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:34:42,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575102377] [2024-11-10 22:34:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:34:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:34:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:42,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:42,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:34:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:43,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:34:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:34:44,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:34:44 BoogieIcfgContainer [2024-11-10 22:34:44,078 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:34:44,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:34:44,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:34:44,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:34:44,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:34:33" (3/4) ... [2024-11-10 22:34:44,084 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:34:44,147 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:34:44,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:34:44,148 INFO L158 Benchmark]: Toolchain (without parser) took 11261.71ms. Allocated memory was 130.0MB in the beginning and 211.8MB in the end (delta: 81.8MB). Free memory was 59.9MB in the beginning and 131.9MB in the end (delta: -72.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-10 22:34:44,148 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:44,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.98ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 59.7MB in the beginning and 146.8MB in the end (delta: -87.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-10 22:34:44,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.19ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:34:44,148 INFO L158 Benchmark]: Boogie Preprocessor took 20.03ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 143.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:34:44,149 INFO L158 Benchmark]: IcfgBuilder took 203.23ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 134.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 22:34:44,149 INFO L158 Benchmark]: BuchiAutomizer took 10680.30ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 134.2MB in the beginning and 136.1MB in the end (delta: -1.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-10 22:34:44,149 INFO L158 Benchmark]: Witness Printer took 68.07ms. Allocated memory is still 211.8MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 22:34:44,150 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.20ms. Allocated memory is still 130.0MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.98ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 59.7MB in the beginning and 146.8MB in the end (delta: -87.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.19ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.03ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 143.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 203.23ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 134.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10680.30ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 134.2MB in the beginning and 136.1MB in the end (delta: -1.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Witness Printer took 68.07ms. Allocated memory is still 211.8MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 157 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 9.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 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 [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 68 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax213 hnf100 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 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: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] Loop: [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] Loop: [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:34:44,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-10 22:34:44,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:44,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-10 22:34:44,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-10 22:34:44,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-10 22:34:45,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)