./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-simple/nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:05:53,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:05:53,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:05:53,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:05:53,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:05:53,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:05:53,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:05:53,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:05:53,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:05:53,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:05:53,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:05:53,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:05:53,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:05:53,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:05:53,661 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:05:53,661 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:05:53,661 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:05:53,667 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:05:53,667 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:05:53,667 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:05:53,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:05:53,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:05:53,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:05:53,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:05:53,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:05:53,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:05:53,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:05:53,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:05:53,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:05:53,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:05:53,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:05:53,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:05:53,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:05:53,670 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:05:53,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:05:53,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:05:53,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:05:53,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:05:53,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:05:53,672 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:05:53,672 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 [2024-11-10 23:05:53,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:05:53,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:05:53,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:05:53,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:05:53,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:05:53,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c [2024-11-10 23:05:55,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:05:55,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:05:55,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c [2024-11-10 23:05:55,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5701993/14781cb406bf4f2d9852273d449ce31c/FLAG0803a9d83 [2024-11-10 23:05:55,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5701993/14781cb406bf4f2d9852273d449ce31c [2024-11-10 23:05:55,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:05:55,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:05:55,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:55,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:05:55,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:05:55,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:55" (1/1) ... [2024-11-10 23:05:55,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc13026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:55, skipping insertion in model container [2024-11-10 23:05:55,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:55" (1/1) ... [2024-11-10 23:05:55,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:05:56,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:56,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:05:56,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:56,248 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:05:56,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56 WrapperNode [2024-11-10 23:05:56,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:56,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:56,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:05:56,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:05:56,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,295 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-11-10 23:05:56,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:56,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:05:56,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:05:56,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:05:56,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,319 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 23:05:56,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:05:56,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:05:56,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:05:56,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:05:56,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (1/1) ... [2024-11-10 23:05:56,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:56,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:56,371 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 23:05:56,378 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 23:05:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:05:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:05:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:05:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:05:56,490 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:05:56,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:05:56,611 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-10 23:05:56,615 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:05:56,628 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:05:56,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:05:56,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:56 BoogieIcfgContainer [2024-11-10 23:05:56,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:05:56,631 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:05:56,632 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:05:56,636 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:05:56,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:56,638 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:05:55" (1/3) ... [2024-11-10 23:05:56,639 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4764c69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:56, skipping insertion in model container [2024-11-10 23:05:56,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:56,640 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:56" (2/3) ... [2024-11-10 23:05:56,641 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4764c69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:56, skipping insertion in model container [2024-11-10 23:05:56,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:56,641 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:56" (3/3) ... [2024-11-10 23:05:56,643 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c [2024-11-10 23:05:56,701 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:05:56,702 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:05:56,702 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:05:56,702 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:05:56,702 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:05:56,703 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:05:56,703 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:05:56,703 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:05:56,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 23:05:56,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-10 23:05:56,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,729 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:05:56,729 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:05:56,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 23:05:56,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-10 23:05:56,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:05:56,741 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 11#L21true [2024-11-10 23:05:56,742 INFO L747 eck$LassoCheckResult]: Loop: 11#L21true assume true; 14#L21-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 8#L22true assume !true; 16#L21-1true main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 11#L21true [2024-11-10 23:05:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 1 times [2024-11-10 23:05:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573849732] [2024-11-10 23:05:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:56,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:56,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1661203, now seen corresponding path program 1 times [2024-11-10 23:05:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047545479] [2024-11-10 23:05:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:56,898 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 23:05:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047545479] [2024-11-10 23:05:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047545479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 23:05:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197821773] [2024-11-10 23:05:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:56,904 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 23:05:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 23:05:56,935 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:56,940 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-11-10 23:05:56,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2024-11-10 23:05:56,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-10 23:05:56,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 12 transitions. [2024-11-10 23:05:56,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 23:05:56,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-10 23:05:56,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-11-10 23:05:56,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:56,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-10 23:05:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-11-10 23:05:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 23:05:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-11-10 23:05:56,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-10 23:05:56,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 23:05:56,981 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-11-10 23:05:56,983 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:05:56,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-11-10 23:05:56,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-10 23:05:56,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:56,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:56,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:56,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 23:05:56,986 INFO L745 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 43#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 44#L21 [2024-11-10 23:05:56,986 INFO L747 eck$LassoCheckResult]: Loop: 44#L21 assume true; 47#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 39#L22 assume true; 40#L22-2 assume !(main_~b~0#1 < 6); 48#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 44#L21 [2024-11-10 23:05:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 2 times [2024-11-10 23:05:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381717309] [2024-11-10 23:05:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash 51496617, now seen corresponding path program 1 times [2024-11-10 23:05:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882049425] [2024-11-10 23:05:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,075 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 23:05:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882049425] [2024-11-10 23:05:57,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882049425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:57,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:05:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693546024] [2024-11-10 23:05:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,079 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:05:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:05:57,080 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 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 23:05:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,098 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2024-11-10 23:05:57,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2024-11-10 23:05:57,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 23:05:57,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2024-11-10 23:05:57,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 23:05:57,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-10 23:05:57,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2024-11-10 23:05:57,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-10 23:05:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2024-11-10 23:05:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2024-11-10 23:05:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 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 23:05:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-11-10 23:05:57,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-10 23:05:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:05:57,107 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-11-10 23:05:57,107 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:05:57,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-11-10 23:05:57,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-10 23:05:57,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:57,112 INFO L745 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 75#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 76#L21 [2024-11-10 23:05:57,112 INFO L747 eck$LassoCheckResult]: Loop: 76#L21 assume true; 79#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 70#L22 assume true; 71#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 78#L23 assume true; 77#L23-2 assume !(main_~c~0#1 < 6); 72#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 73#L22 assume true; 81#L22-2 assume !(main_~b~0#1 < 6); 80#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 76#L21 [2024-11-10 23:05:57,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 3 times [2024-11-10 23:05:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33059397] [2024-11-10 23:05:57,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1274491714, now seen corresponding path program 1 times [2024-11-10 23:05:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846328026] [2024-11-10 23:05:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846328026] [2024-11-10 23:05:57,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846328026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:57,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:57,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:05:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778195788] [2024-11-10 23:05:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,180 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:05:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:05:57,181 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 3 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 23:05:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,194 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-11-10 23:05:57,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-11-10 23:05:57,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-10 23:05:57,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2024-11-10 23:05:57,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-10 23:05:57,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 23:05:57,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-10 23:05:57,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 23:05:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-10 23:05:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-10 23:05:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-10 23:05:57,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 23:05:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:05:57,202 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 23:05:57,203 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:05:57,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-10 23:05:57,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-10 23:05:57,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:57,204 INFO L745 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 107#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 108#L21 [2024-11-10 23:05:57,204 INFO L747 eck$LassoCheckResult]: Loop: 108#L21 assume true; 111#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 102#L22 assume true; 103#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 112#L23 assume true; 109#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 110#L23 assume true; 114#L23-2 assume !(main_~c~0#1 < 6); 104#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 105#L22 assume true; 115#L22-2 assume !(main_~b~0#1 < 6); 113#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 108#L21 [2024-11-10 23:05:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 4 times [2024-11-10 23:05:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593654159] [2024-11-10 23:05:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1188757309, now seen corresponding path program 1 times [2024-11-10 23:05:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978602559] [2024-11-10 23:05:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978602559] [2024-11-10 23:05:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978602559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662917802] [2024-11-10 23:05:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:57,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:57,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 23:05:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 23:05:57,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662917802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:57,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 23:05:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177574506] [2024-11-10 23:05:57,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,457 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:05:57,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:05:57,458 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:57,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:57,504 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-10 23:05:57,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2024-11-10 23:05:57,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-10 23:05:57,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2024-11-10 23:05:57,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-10 23:05:57,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-10 23:05:57,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2024-11-10 23:05:57,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:57,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 23:05:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2024-11-10 23:05:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 23:05:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 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 23:05:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-10 23:05:57,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 23:05:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:05:57,509 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-10 23:05:57,509 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:05:57,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-11-10 23:05:57,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-10 23:05:57,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:57,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:57,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:57,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:57,512 INFO L745 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 216#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 217#L21 [2024-11-10 23:05:57,512 INFO L747 eck$LassoCheckResult]: Loop: 217#L21 assume true; 220#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 211#L22 assume true; 212#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 221#L23 assume true; 218#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 219#L23 assume true; 230#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 229#L23 assume true; 228#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 227#L23 assume true; 226#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 224#L23 assume true; 223#L23-2 assume !(main_~c~0#1 < 6); 213#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 214#L22 assume true; 225#L22-2 assume !(main_~b~0#1 < 6); 222#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 217#L21 [2024-11-10 23:05:57,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 5 times [2024-11-10 23:05:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572714989] [2024-11-10 23:05:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:57,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:57,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash -227704774, now seen corresponding path program 2 times [2024-11-10 23:05:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:57,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804627605] [2024-11-10 23:05:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 23:05:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804627605] [2024-11-10 23:05:57,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804627605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906344695] [2024-11-10 23:05:57,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:05:57,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:57,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:57,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:57,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 23:05:57,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:05:57,662 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:57,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 23:05:57,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906344695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:57,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:57,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-11-10 23:05:57,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917996399] [2024-11-10 23:05:57,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:57,856 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 23:05:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 23:05:57,857 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:58,049 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-10 23:05:58,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 60 transitions. [2024-11-10 23:05:58,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2024-11-10 23:05:58,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 60 transitions. [2024-11-10 23:05:58,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-10 23:05:58,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-10 23:05:58,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 60 transitions. [2024-11-10 23:05:58,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:58,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-11-10 23:05:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 60 transitions. [2024-11-10 23:05:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2024-11-10 23:05:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-10 23:05:58,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-10 23:05:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 23:05:58,056 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-10 23:05:58,056 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:05:58,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 44 transitions. [2024-11-10 23:05:58,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2024-11-10 23:05:58,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:58,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:58,059 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:58,059 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 12, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-10 23:05:58,060 INFO L745 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 431#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 432#L21 [2024-11-10 23:05:58,060 INFO L747 eck$LassoCheckResult]: Loop: 432#L21 assume true; 435#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 426#L22 assume true; 427#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 456#L23 assume true; 455#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 454#L23 assume true; 453#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 452#L23 assume true; 451#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 450#L23 assume true; 449#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 448#L23 assume true; 447#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 446#L23 assume true; 445#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 444#L23 assume true; 443#L23-2 assume !(main_~c~0#1 < 6); 428#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 429#L22 assume true; 437#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 438#L23 assume true; 433#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 434#L23 assume true; 436#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 466#L23 assume true; 465#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 464#L23 assume true; 463#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 462#L23 assume true; 461#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 460#L23 assume true; 459#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 458#L23 assume true; 457#L23-2 assume !(main_~c~0#1 < 6); 442#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 441#L22 assume true; 440#L22-2 assume !(main_~b~0#1 < 6); 439#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 432#L21 [2024-11-10 23:05:58,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 6 times [2024-11-10 23:05:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426356959] [2024-11-10 23:05:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:58,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1876222327, now seen corresponding path program 3 times [2024-11-10 23:05:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861510015] [2024-11-10 23:05:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 23:05:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861510015] [2024-11-10 23:05:58,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861510015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:05:58,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682950209] [2024-11-10 23:05:58,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 23:05:58,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:05:58,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:58,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:05:58,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 23:05:58,275 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-10 23:05:58,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:05:58,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:05:58,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 23:05:58,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:05:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 23:05:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682950209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:05:58,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:05:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 23:05:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172804270] [2024-11-10 23:05:58,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:05:58,438 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:05:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 23:05:58,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-10 23:05:58,439 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:58,484 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-11-10 23:05:58,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 116 transitions. [2024-11-10 23:05:58,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2024-11-10 23:05:58,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 116 transitions. [2024-11-10 23:05:58,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2024-11-10 23:05:58,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2024-11-10 23:05:58,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 116 transitions. [2024-11-10 23:05:58,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:05:58,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-11-10 23:05:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 116 transitions. [2024-11-10 23:05:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-10 23:05:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.0642201834862386) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 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 23:05:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-11-10 23:05:58,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-11-10 23:05:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:05:58,500 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-11-10 23:05:58,500 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:05:58,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 116 transitions. [2024-11-10 23:05:58,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2024-11-10 23:05:58,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:58,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:58,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:58,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 36, 7, 6, 6, 6, 1, 1, 1, 1] [2024-11-10 23:05:58,506 INFO L745 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 820#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 821#L21 [2024-11-10 23:05:58,506 INFO L747 eck$LassoCheckResult]: Loop: 821#L21 assume true; 824#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 815#L22 assume true; 816#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 826#L23 assume true; 922#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 921#L23 assume true; 919#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 917#L23 assume true; 915#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 913#L23 assume true; 911#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 909#L23 assume true; 907#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 905#L23 assume true; 903#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 900#L23 assume true; 899#L23-2 assume !(main_~c~0#1 < 6); 817#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 818#L22 assume true; 923#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 825#L23 assume true; 822#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 823#L23 assume true; 920#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 918#L23 assume true; 916#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 914#L23 assume true; 912#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 910#L23 assume true; 908#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 906#L23 assume true; 904#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 902#L23 assume true; 901#L23-2 assume !(main_~c~0#1 < 6); 898#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 897#L22 assume true; 896#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 895#L23 assume true; 894#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 893#L23 assume true; 892#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 891#L23 assume true; 890#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 889#L23 assume true; 888#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 887#L23 assume true; 886#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 885#L23 assume true; 884#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 883#L23 assume true; 882#L23-2 assume !(main_~c~0#1 < 6); 881#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 880#L22 assume true; 879#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 878#L23 assume true; 877#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 876#L23 assume true; 875#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 874#L23 assume true; 873#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 872#L23 assume true; 871#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 870#L23 assume true; 869#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 868#L23 assume true; 867#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 866#L23 assume true; 865#L23-2 assume !(main_~c~0#1 < 6); 864#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 863#L22 assume true; 862#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 861#L23 assume true; 860#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 859#L23 assume true; 858#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 857#L23 assume true; 856#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 855#L23 assume true; 854#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 853#L23 assume true; 852#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 851#L23 assume true; 850#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 849#L23 assume true; 848#L23-2 assume !(main_~c~0#1 < 6); 847#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 846#L22 assume true; 845#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 829#L23 assume true; 844#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 843#L23 assume true; 842#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 841#L23 assume true; 840#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 839#L23 assume true; 838#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 837#L23 assume true; 836#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 835#L23 assume true; 834#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 833#L23 assume true; 832#L23-2 assume !(main_~c~0#1 < 6); 831#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 830#L22 assume true; 828#L22-2 assume !(main_~b~0#1 < 6); 827#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 821#L21 [2024-11-10 23:05:58,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1824, now seen corresponding path program 7 times [2024-11-10 23:05:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37147153] [2024-11-10 23:05:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:58,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash 764536393, now seen corresponding path program 4 times [2024-11-10 23:05:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100558928] [2024-11-10 23:05:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1815591370, now seen corresponding path program 1 times [2024-11-10 23:05:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332813408] [2024-11-10 23:05:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:58,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:59,595 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:59,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:59,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:59,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:59,596 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:05:59,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:59,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:59,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-10 23:05:59,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:59,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:59,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,694 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:59,694 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:05:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:59,699 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 23:05:59,702 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 23:05:59,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:59,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:59,722 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:59,722 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:59,738 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 23:05:59,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:59,740 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 23:05:59,742 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 23:05:59,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:59,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:59,757 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:59,757 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~b~0#1=6} Honda state: {ULTIMATE.start_main_~b~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:59,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 23:05:59,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:59,775 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 23:05:59,777 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 23:05:59,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:59,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:59,796 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:59,796 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:59,812 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 23:05:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:59,814 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 23:05:59,815 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 23:05:59,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:59,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:59,848 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 23:05:59,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:59,850 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 23:05:59,852 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 23:05:59,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:05:59,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:59,889 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:05:59,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:59,895 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:59,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:59,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:59,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:59,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:59,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:59,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:59,897 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop [2024-11-10 23:05:59,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:59,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:59,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:59,954 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:59,959 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:59,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:59,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:59,962 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 23:05:59,964 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 23:05:59,965 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 23:05:59,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:59,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:59,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:59,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:59,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:59,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:59,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:59,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:00,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-10 23:06:00,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:00,007 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 23:06:00,008 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 23:06:00,009 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 23:06:00,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:00,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:00,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:00,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:00,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:00,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:00,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:00,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:00,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 23:06:00,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:00,041 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 23:06:00,043 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 23:06:00,044 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 23:06:00,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:00,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:00,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:00,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:00,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:00,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:00,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:00,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:00,070 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 23:06:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:00,072 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 23:06:00,073 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 23:06:00,074 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 23:06:00,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:00,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:00,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:00,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:00,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:00,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:00,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:00,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:00,094 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:00,094 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:00,098 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 23:06:00,100 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 23:06:00,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:00,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:00,101 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:00,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:00,115 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:00,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:00,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:00,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:00,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-11-10 23:06:00,715 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 23:06:00,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:00,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 116 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 216 states and 231 transitions. Complement of second has 6 states. [2024-11-10 23:06:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2024-11-10 23:06:00,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 107 letters. [2024-11-10 23:06:00,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:00,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 109 letters. Loop has 107 letters. [2024-11-10 23:06:00,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:00,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 214 letters. [2024-11-10 23:06:00,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:00,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 231 transitions. [2024-11-10 23:06:00,778 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 27 [2024-11-10 23:06:00,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 215 states and 230 transitions. [2024-11-10 23:06:00,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2024-11-10 23:06:00,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2024-11-10 23:06:00,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 230 transitions. [2024-11-10 23:06:00,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:00,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 230 transitions. [2024-11-10 23:06:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 230 transitions. [2024-11-10 23:06:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 128. [2024-11-10 23:06:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.078125) internal successors, (138), 127 states have internal predecessors, (138), 0 states have call successors, (0), 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 23:06:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2024-11-10 23:06:00,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 138 transitions. [2024-11-10 23:06:00,794 INFO L425 stractBuchiCegarLoop]: Abstraction has 128 states and 138 transitions. [2024-11-10 23:06:00,795 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 23:06:00,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 138 transitions. [2024-11-10 23:06:00,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-10 23:06:00,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:00,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:00,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-10 23:06:00,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2024-11-10 23:06:00,798 INFO L745 eck$LassoCheckResult]: Stem: 1493#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1494#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1498#L21 assume true; 1504#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1489#L22 [2024-11-10 23:06:00,799 INFO L747 eck$LassoCheckResult]: Loop: 1489#L22 assume true; 1490#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1506#L23 assume true; 1499#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1500#L23 assume true; 1616#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1615#L23 assume true; 1614#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1613#L23 assume true; 1612#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1611#L23 assume true; 1610#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1609#L23 assume true; 1608#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1582#L23 assume true; 1581#L23-2 assume !(main_~c~0#1 < 6); 1495#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 1489#L22 [2024-11-10 23:06:00,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1753631, now seen corresponding path program 1 times [2024-11-10 23:06:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193729657] [2024-11-10 23:06:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1254819120, now seen corresponding path program 1 times [2024-11-10 23:06:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190951178] [2024-11-10 23:06:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:00,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -664468782, now seen corresponding path program 1 times [2024-11-10 23:06:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:00,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569846592] [2024-11-10 23:06:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:00,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:00,888 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:00,888 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:00,888 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:00,889 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:00,889 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:00,889 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,889 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:00,889 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:00,889 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-10 23:06:00,889 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:00,889 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:00,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:00,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:00,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:00,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:00,927 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:00,927 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:00,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:00,929 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 23:06:00,930 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 23:06:00,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:00,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:00,947 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:00,947 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:00,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:00,964 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 23:06:00,967 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 23:06:00,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:00,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,000 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 23:06:01,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,002 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 23:06:01,004 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 23:06:01,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:01,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,040 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:01,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:01,046 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:01,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:01,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:01,046 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:01,046 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:01,046 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,046 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:01,046 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:01,047 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop [2024-11-10 23:06:01,047 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:01,047 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:01,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,088 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:01,089 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:01,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,090 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:01,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 23:06:01,093 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 23:06:01,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:01,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:01,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:01,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:01,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:01,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:01,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:01,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:01,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:01,109 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:01,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,111 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 23:06:01,112 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 23:06:01,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:01,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:01,113 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:01,113 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:01,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:01,126 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:01,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:01,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:01,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:01,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:01,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:01,205 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 23:06:01,230 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 23:06:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:01,259 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 23:06:01,259 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 138 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:01,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 138 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 373 states and 401 transitions. Complement of second has 7 states. [2024-11-10 23:06:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-10 23:06:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 17 letters. [2024-11-10 23:06:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 21 letters. Loop has 17 letters. [2024-11-10 23:06:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 34 letters. [2024-11-10 23:06:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:01,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 401 transitions. [2024-11-10 23:06:01,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-10 23:06:01,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 272 states and 293 transitions. [2024-11-10 23:06:01,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-10 23:06:01,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-10 23:06:01,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 293 transitions. [2024-11-10 23:06:01,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:01,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 272 states and 293 transitions. [2024-11-10 23:06:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 293 transitions. [2024-11-10 23:06:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 255. [2024-11-10 23:06:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 1.0784313725490196) internal successors, (275), 254 states have internal predecessors, (275), 0 states have call successors, (0), 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 23:06:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 275 transitions. [2024-11-10 23:06:01,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 275 transitions. [2024-11-10 23:06:01,326 INFO L425 stractBuchiCegarLoop]: Abstraction has 255 states and 275 transitions. [2024-11-10 23:06:01,329 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 23:06:01,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 275 transitions. [2024-11-10 23:06:01,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-10 23:06:01,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:01,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:01,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-10 23:06:01,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:06:01,331 INFO L745 eck$LassoCheckResult]: Stem: 2083#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2084#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 2085#L21 assume true; 2090#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2113#L22 assume true; 2096#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2087#L23 [2024-11-10 23:06:01,331 INFO L747 eck$LassoCheckResult]: Loop: 2087#L23 assume true; 2086#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2087#L23 [2024-11-10 23:06:01,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1685239966, now seen corresponding path program 1 times [2024-11-10 23:06:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145679044] [2024-11-10 23:06:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:01,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 1 times [2024-11-10 23:06:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:01,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543932350] [2024-11-10 23:06:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:01,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 312937117, now seen corresponding path program 1 times [2024-11-10 23:06:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:01,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944190681] [2024-11-10 23:06:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:01,376 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:01,377 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:01,377 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:01,377 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:01,377 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:01,377 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,377 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:01,377 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:01,377 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-10 23:06:01,377 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:01,377 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:01,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,402 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:01,402 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:01,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,404 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 23:06:01,406 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 23:06:01,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:01,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,421 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:01,422 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:01,437 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 23:06:01,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,439 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 23:06:01,440 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 23:06:01,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:01,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,470 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 23:06:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,473 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 23:06:01,474 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 23:06:01,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:01,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,510 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:01,515 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 23:06:01,516 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:01,516 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:01,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:01,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:01,516 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:01,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,516 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:01,516 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:01,516 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop [2024-11-10 23:06:01,516 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:01,516 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:01,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,538 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:01,539 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,540 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:01,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 23:06:01,543 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 23:06:01,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:01,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:01,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:01,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:01,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:01,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:01,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:01,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:01,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:01,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,570 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 23:06:01,571 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 23:06:01,572 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 23:06:01,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:01,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:01,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:01,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:01,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:01,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:01,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:01,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:01,588 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:01,588 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:01,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,590 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 23:06:01,591 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 23:06:01,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:01,592 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:01,592 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:01,592 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:01,608 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 23:06:01,609 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:01,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:01,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:01,638 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:01,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:01,640 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 23:06:01,640 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 23:06:01,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 275 transitions. cyclomatic complexity: 30 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 23:06:01,650 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 275 transitions. cyclomatic complexity: 30. 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 300 states and 323 transitions. Complement of second has 5 states. [2024-11-10 23:06:01,650 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 23:06:01,651 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 23:06:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-10 23:06:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-10 23:06:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-10 23:06:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-10 23:06:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:01,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 323 transitions. [2024-11-10 23:06:01,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-10 23:06:01,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 276 states and 297 transitions. [2024-11-10 23:06:01,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-10 23:06:01,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-10 23:06:01,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 276 states and 297 transitions. [2024-11-10 23:06:01,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:01,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 276 states and 297 transitions. [2024-11-10 23:06:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states and 297 transitions. [2024-11-10 23:06:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2024-11-10 23:06:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.0740740740740742) internal successors, (290), 269 states have internal predecessors, (290), 0 states have call successors, (0), 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 23:06:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 290 transitions. [2024-11-10 23:06:01,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 290 transitions. [2024-11-10 23:06:01,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 270 states and 290 transitions. [2024-11-10 23:06:01,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 23:06:01,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 290 transitions. [2024-11-10 23:06:01,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2024-11-10 23:06:01,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:01,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:01,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 23:06:01,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 23:06:01,677 INFO L745 eck$LassoCheckResult]: Stem: 2682#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2683#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 2684#L21 assume true; 2689#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2674#L22 assume true; 2675#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2751#L23 assume true; 2750#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2749#L23 assume true; 2748#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2747#L23 assume true; 2746#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2745#L23 assume true; 2744#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2743#L23 assume true; 2742#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2741#L23 assume true; 2727#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2728#L23 assume true; 2719#L23-2 assume !(main_~c~0#1 < 6); 2716#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 2714#L22 assume true; 2695#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2686#L23 [2024-11-10 23:06:01,677 INFO L747 eck$LassoCheckResult]: Loop: 2686#L23 assume true; 2685#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2686#L23 [2024-11-10 23:06:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1395628177, now seen corresponding path program 2 times [2024-11-10 23:06:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288627532] [2024-11-10 23:06:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:01,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1344, now seen corresponding path program 2 times [2024-11-10 23:06:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636932826] [2024-11-10 23:06:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:01,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1168882128, now seen corresponding path program 3 times [2024-11-10 23:06:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578159405] [2024-11-10 23:06:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:01,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:01,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:01,735 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:01,735 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:01,735 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:01,735 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:01,735 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:01,736 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,736 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:01,736 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:01,736 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-10 23:06:01,736 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:01,736 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:01,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,757 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:01,758 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:01,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,760 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 23:06:01,761 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 23:06:01,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:01,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,777 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:01,777 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:01,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-10 23:06:01,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,794 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 23:06:01,795 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 23:06:01,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:01,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,828 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 23:06:01,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,830 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 23:06:01,832 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 23:06:01,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:01,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:01,868 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:01,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-10 23:06:01,874 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:01,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:01,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:01,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:01,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:01,874 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,874 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:01,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:01,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop [2024-11-10 23:06:01,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:01,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:01,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:01,897 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:01,897 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:01,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,900 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 23:06:01,901 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 23:06:01,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:01,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:01,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:01,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:01,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:01,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:01,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:01,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:01,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:01,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-10 23:06:01,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,933 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 23:06:01,935 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 23:06:01,936 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 23:06:01,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:01,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:01,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:01,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:01,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:01,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:01,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:01,951 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:01,955 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:01,955 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:01,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:01,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:01,957 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 23:06:01,958 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 23:06:01,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:01,959 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:01,959 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:01,959 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:01,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-10 23:06:01,971 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:01,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:01,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:01,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,025 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,027 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 23:06:02,028 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 23:06:02,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 290 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:02,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 290 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 295 states and 318 transitions. Complement of second has 5 states. [2024-11-10 23:06:02,037 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 23:06:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-10 23:06:02,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-10 23:06:02,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:02,038 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:02,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,093 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,099 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 23:06:02,099 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 23:06:02,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 290 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:02,108 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 290 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 295 states and 318 transitions. Complement of second has 5 states. [2024-11-10 23:06:02,109 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 23:06:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-10 23:06:02,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-10 23:06:02,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:02,110 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:02,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,172 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,174 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 23:06:02,174 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 23:06:02,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 290 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:02,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 290 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 426 states and 453 transitions. Complement of second has 4 states. [2024-11-10 23:06:02,189 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 23:06:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2024-11-10 23:06:02,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-10 23:06:02,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:02,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-10 23:06:02,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:02,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2024-11-10 23:06:02,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:02,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 426 states and 453 transitions. [2024-11-10 23:06:02,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-10 23:06:02,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 426 states to 245 states and 261 transitions. [2024-11-10 23:06:02,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-10 23:06:02,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-10 23:06:02,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 261 transitions. [2024-11-10 23:06:02,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:06:02,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 245 states and 261 transitions. [2024-11-10 23:06:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 261 transitions. [2024-11-10 23:06:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 233. [2024-11-10 23:06:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.0686695278969958) internal successors, (249), 232 states have internal predecessors, (249), 0 states have call successors, (0), 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 23:06:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 249 transitions. [2024-11-10 23:06:02,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 249 transitions. [2024-11-10 23:06:02,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 233 states and 249 transitions. [2024-11-10 23:06:02,205 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 23:06:02,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 249 transitions. [2024-11-10 23:06:02,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-10 23:06:02,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:06:02,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:06:02,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [42, 36, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1] [2024-11-10 23:06:02,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2024-11-10 23:06:02,212 INFO L745 eck$LassoCheckResult]: Stem: 4218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4219#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 4220#L21 assume true; 4224#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 4424#L22 assume true; 4423#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4422#L23 assume true; 4421#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4420#L23 assume true; 4419#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4418#L23 assume true; 4417#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4416#L23 assume true; 4415#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4414#L23 assume true; 4413#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4412#L23 assume true; 4411#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4410#L23 assume true; 4392#L23-2 assume !(main_~c~0#1 < 6); 4393#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4406#L22 assume true; 4405#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4404#L23 assume true; 4403#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4402#L23 assume true; 4401#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4400#L23 assume true; 4399#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4398#L23 assume true; 4397#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4396#L23 assume true; 4395#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4394#L23 assume true; 4391#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4390#L23 assume true; 4389#L23-2 assume !(main_~c~0#1 < 6); 4388#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4387#L22 assume true; 4386#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4385#L23 assume true; 4384#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4383#L23 assume true; 4382#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4381#L23 assume true; 4380#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4379#L23 assume true; 4378#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4377#L23 assume true; 4376#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4375#L23 assume true; 4357#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4356#L23 assume true; 4355#L23-2 assume !(main_~c~0#1 < 6); 4354#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4353#L22 assume true; 4352#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4351#L23 assume true; 4350#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4349#L23 assume true; 4348#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4347#L23 assume true; 4346#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4345#L23 assume true; 4344#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4343#L23 assume true; 4342#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4341#L23 assume true; 4323#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4322#L23 assume true; 4321#L23-2 assume !(main_~c~0#1 < 6); 4320#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4319#L22 assume true; 4318#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4317#L23 assume true; 4316#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4315#L23 assume true; 4314#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4313#L23 assume true; 4312#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4311#L23 assume true; 4310#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4309#L23 assume true; 4308#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4307#L23 assume true; 4289#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4288#L23 assume true; 4285#L23-2 assume !(main_~c~0#1 < 6); 4283#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4281#L22 assume true; 4277#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4278#L23 assume true; 4273#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4274#L23 assume true; 4269#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4270#L23 assume true; 4265#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4266#L23 assume true; 4261#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4262#L23 assume true; 4257#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4258#L23 assume true; 4252#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4251#L23 assume true; 4253#L23-2 assume !(main_~c~0#1 < 6); 4247#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4248#L22 assume true; 4233#L22-2 assume !(main_~b~0#1 < 6); 4232#L21-1 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 4225#L21 assume true; 4226#L21-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 4211#L22 [2024-11-10 23:06:02,212 INFO L747 eck$LassoCheckResult]: Loop: 4211#L22 assume true; 4212#L22-2 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 4228#L23 assume true; 4229#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4246#L23 assume true; 4245#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4244#L23 assume true; 4243#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4242#L23 assume true; 4241#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4240#L23 assume true; 4239#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4238#L23 assume true; 4235#L23-2 assume !!(main_~c~0#1 < 6);main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 4234#L23 assume true; 4221#L23-2 assume !(main_~c~0#1 < 6); 4215#L22-1 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 4211#L22 [2024-11-10 23:06:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1026585161, now seen corresponding path program 2 times [2024-11-10 23:06:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967594126] [2024-11-10 23:06:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:02,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:02,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:02,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1254819120, now seen corresponding path program 2 times [2024-11-10 23:06:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209525032] [2024-11-10 23:06:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:02,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:02,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:02,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1398041576, now seen corresponding path program 3 times [2024-11-10 23:06:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:06:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373848058] [2024-11-10 23:06:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:06:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:06:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:02,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:06:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:06:02,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:06:02,360 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:02,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:02,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:02,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:02,360 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:06:02,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,361 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:02,361 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:02,361 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration11_Loop [2024-11-10 23:06:02,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:02,361 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:02,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,395 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:02,396 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:06:02,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,398 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 23:06:02,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:02,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:02,413 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:02,414 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:02,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-10 23:06:02,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,430 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 23:06:02,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:02,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:02,449 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:02,449 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=6} Honda state: {ULTIMATE.start_main_~c~0#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:02,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-10 23:06:02,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,466 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 23:06:02,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:02,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:02,484 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:06:02,484 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:06:02,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:02,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,501 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-10 23:06:02,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:06:02,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:02,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-10 23:06:02,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,525 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 23:06:02,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:06:02,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:06:02,554 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:06:02,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:02,558 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:06:02,558 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:06:02,558 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:06:02,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:06:02,558 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:06:02,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:06:02,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:06:02,559 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration11_Loop [2024-11-10 23:06:02,559 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:06:02,559 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:06:02,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:06:02,597 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:06:02,597 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:06:02,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,599 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 23:06:02,600 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 23:06:02,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:02,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:02,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:02,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:02,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:02,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:02,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:02,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:02,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,624 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 23:06:02,625 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 23:06:02,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:02,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:02,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:02,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:02,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:02,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:02,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:02,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:02,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,649 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 23:06:02,665 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 23:06:02,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-10 23:06:02,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:02,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:02,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:02,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:02,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:02,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:02,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:02,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:06:02,683 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 23:06:02,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-10 23:06:02,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,694 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 23:06:02,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 23:06:02,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:06:02,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:06:02,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:06:02,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:06:02,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:06:02,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:06:02,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:06:02,711 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:06:02,713 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:06:02,713 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:06:02,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:06:02,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:06:02,715 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:06:02,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-10 23:06:02,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:06:02,717 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:06:02,718 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:06:02,718 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11 Supporting invariants [] [2024-11-10 23:06:02,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:02,730 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:06:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:02,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:02,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:02,980 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 23:06:02,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 249 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:03,002 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 249 transitions. cyclomatic complexity: 24. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 338 states and 362 transitions. Complement of second has 7 states. [2024-11-10 23:06:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-10 23:06:03,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 111 letters. Loop has 17 letters. [2024-11-10 23:06:03,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:03,005 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:03,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:03,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:03,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:03,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:03,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:03,242 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 23:06:03,242 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 249 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:03,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 249 transitions. cyclomatic complexity: 24. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 338 states and 362 transitions. Complement of second has 7 states. [2024-11-10 23:06:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-10 23:06:03,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 111 letters. Loop has 17 letters. [2024-11-10 23:06:03,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:03,259 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 23:06:03,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:06:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:03,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:06:03,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:06:03,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:06:03,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:06:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 23:06:03,513 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 23:06:03,513 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 249 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:03,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 249 transitions. cyclomatic complexity: 24. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 448 states and 481 transitions. Complement of second has 6 states. [2024-11-10 23:06:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 23:06:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:06:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-10 23:06:03,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 111 letters. Loop has 17 letters. [2024-11-10 23:06:03,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:03,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 128 letters. Loop has 17 letters. [2024-11-10 23:06:03,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:03,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 111 letters. Loop has 34 letters. [2024-11-10 23:06:03,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:06:03,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448 states and 481 transitions. [2024-11-10 23:06:03,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:06:03,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448 states to 0 states and 0 transitions. [2024-11-10 23:06:03,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 23:06:03,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 23:06:03,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 23:06:03,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:06:03,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:06:03,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:06:03,542 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 23:06:03,542 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-10 23:06:03,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 23:06:03,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 23:06:03,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 23:06:03,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:06:03 BoogieIcfgContainer [2024-11-10 23:06:03,552 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:06:03,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:06:03,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:06:03,553 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:06:03,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:56" (3/4) ... [2024-11-10 23:06:03,556 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 23:06:03,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:06:03,557 INFO L158 Benchmark]: Toolchain (without parser) took 7588.73ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 150.5MB in the beginning and 93.0MB in the end (delta: 57.6MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2024-11-10 23:06:03,558 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:06:03,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.38ms. Allocated memory is still 180.4MB. Free memory was 150.3MB in the beginning and 142.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-10 23:06:03,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 180.4MB. Free memory was 142.4MB in the beginning and 140.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:06:03,559 INFO L158 Benchmark]: Boogie Preprocessor took 34.79ms. Allocated memory is still 180.4MB. Free memory was 140.4MB in the beginning and 139.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:06:03,559 INFO L158 Benchmark]: IcfgBuilder took 298.19ms. Allocated memory is still 180.4MB. Free memory was 139.0MB in the beginning and 129.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 23:06:03,559 INFO L158 Benchmark]: BuchiAutomizer took 6920.54ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 129.3MB in the beginning and 93.0MB in the end (delta: 36.3MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2024-11-10 23:06:03,560 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 218.1MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:06:03,561 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 127.9MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.38ms. Allocated memory is still 180.4MB. Free memory was 150.3MB in the beginning and 142.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 180.4MB. Free memory was 142.4MB in the beginning and 140.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.79ms. Allocated memory is still 180.4MB. Free memory was 140.4MB in the beginning and 139.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 298.19ms. Allocated memory is still 180.4MB. Free memory was 139.0MB in the beginning and 129.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6920.54ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 129.3MB in the beginning and 93.0MB in the end (delta: 36.3MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 218.1MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 12 iterations. TraceHistogramMax:42. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 140 StatesRemovedByMinimization, 6 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1863/1863 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 318 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 180 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-10 23:06:03,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:03,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:03,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:04,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 23:06:04,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE