./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:55:55,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:55:55,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:55:55,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:55:55,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:55:55,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:55:55,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:55:55,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:55:55,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:55:55,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:55:55,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:55:55,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:55:55,695 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:55:55,695 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:55:55,697 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:55:55,697 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:55:55,697 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:55:55,697 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:55:55,698 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:55:55,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:55:55,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:55:55,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:55:55,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:55:55,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:55:55,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:55:55,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:55:55,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:55:55,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:55:55,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:55:55,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:55:55,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:55:55,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:55:55,701 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:55:55,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:55:55,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:55:55,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:55:55,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:55:55,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:55:55,702 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:55:55,703 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 -> 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c [2024-10-15 00:55:55,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:55:55,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:55:55,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:55:55,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:55:55,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:55:55,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-10-15 00:55:57,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:55:57,552 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:55:57,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-10-15 00:55:57,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0f626f0/1ff01010f9b541ae93d92d0e86a647e0/FLAG2af02cbbc [2024-10-15 00:55:57,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0f626f0/1ff01010f9b541ae93d92d0e86a647e0 [2024-10-15 00:55:57,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:55:57,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:55:57,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:55:57,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:55:57,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:55:57,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:55:57" (1/1) ... [2024-10-15 00:55:57,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b87020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:57, skipping insertion in model container [2024-10-15 00:55:57,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:55:57" (1/1) ... [2024-10-15 00:55:57,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:55:58,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:55:58,120 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:55:58,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:55:58,149 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:55:58,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58 WrapperNode [2024-10-15 00:55:58,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:55:58,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:55:58,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:55:58,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:55:58,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,192 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-15 00:55:58,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:55:58,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:55:58,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:55:58,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:55:58,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,217 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-10-15 00:55:58,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:55:58,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:55:58,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:55:58,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:55:58,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (1/1) ... [2024-10-15 00:55:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:58,269 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-10-15 00:55:58,273 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-10-15 00:55:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:55:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:55:58,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:55:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:55:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2024-10-15 00:55:58,327 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2024-10-15 00:55:58,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:55:58,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:55:58,529 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-15 00:55:58,529 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:55:58,545 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:55:58,545 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 00:55:58,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:58 BoogieIcfgContainer [2024-10-15 00:55:58,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:55:58,546 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:55:58,546 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:55:58,550 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:55:58,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:55:58,551 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:55:57" (1/3) ... [2024-10-15 00:55:58,552 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a923595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:55:58, skipping insertion in model container [2024-10-15 00:55:58,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:55:58,552 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:55:58" (2/3) ... [2024-10-15 00:55:58,553 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a923595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:55:58, skipping insertion in model container [2024-10-15 00:55:58,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:55:58,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:58" (3/3) ... [2024-10-15 00:55:58,556 INFO L332 chiAutomizerObserver]: Analyzing ICFG McCarthy91-2.c [2024-10-15 00:55:58,607 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:55:58,607 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:55:58,608 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:55:58,608 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:55:58,609 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:55:58,610 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:55:58,610 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:55:58,610 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:55:58,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 00:55:58,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:55:58,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:55:58,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:55:58,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:55:58,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:55:58,639 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:55:58,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 00:55:58,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:55:58,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:55:58,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:55:58,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:55:58,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:55:58,648 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 14#L28true call main_#t~ret7#1 := f91(main_~x~0#1);< 12#$Ultimate##0true [2024-10-15 00:55:58,649 INFO L747 eck$LassoCheckResult]: Loop: 12#$Ultimate##0true ~x := #in~x; 8#L18true assume !(~x > 100); 10#L21true call #t~ret4 := f91(11 + ~x);< 12#$Ultimate##0true [2024-10-15 00:55:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 29879, now seen corresponding path program 1 times [2024-10-15 00:55:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:55:58,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193306775] [2024-10-15 00:55:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:55:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:55:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:58,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:55:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:58,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:55:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 46807, now seen corresponding path program 1 times [2024-10-15 00:55:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:55:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382296567] [2024-10-15 00:55:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:55:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:55:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:58,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:55:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:58,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:55:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 890142305, now seen corresponding path program 1 times [2024-10-15 00:55:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:55:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462073675] [2024-10-15 00:55:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:55:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:55:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:58,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:55:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:58,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:55:58,896 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:55:58,897 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:55:58,897 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:55:58,897 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:55:58,897 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:55:58,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:58,898 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:55:58,898 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:55:58,898 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration1_Loop [2024-10-15 00:55:58,898 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:55:58,898 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:55:58,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:58,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:58,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:58,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:58,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:59,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:55:59,001 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:55:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:59,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:55:59,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:55:59,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:55:59,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:55:59,026 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:55:59,027 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:55:59,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:55:59,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:59,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:55:59,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:55:59,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:55:59,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:55:59,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:55:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:59,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:55:59,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:55:59,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:55:59,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:55:59,451 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:55:59,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-15 00:55:59,458 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:55:59,458 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:55:59,458 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:55:59,458 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:55:59,458 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:55:59,458 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,458 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:55:59,458 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:55:59,458 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration1_Loop [2024-10-15 00:55:59,459 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:55:59,459 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:55:59,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:59,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:59,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:59,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:59,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:55:59,508 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:55:59,512 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:55:59,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:59,515 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-10-15 00:55:59,517 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-10-15 00:55:59,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:55:59,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:55:59,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:55:59,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:55:59,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:55:59,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:55:59,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:55:59,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:55:59,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:55:59,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-15 00:55:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:59,555 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-10-15 00:55:59,556 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-10-15 00:55:59,558 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-10-15 00:55:59,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:55:59,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:55:59,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:55:59,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:55:59,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:55:59,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:55:59,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:55:59,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:55:59,578 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:55:59,579 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:55:59,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:55:59,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:55:59,611 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-10-15 00:55:59,613 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-10-15 00:55:59,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:55:59,614 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:55:59,614 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:55:59,615 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2024-10-15 00:55:59,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:55:59,631 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:55:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:55:59,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:55:59,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:55:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:55:59,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:55:59,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:55:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:55:59,785 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:55:59,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:55:59,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 16 states. [2024-10-15 00:55:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:55:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:55:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2024-10-15 00:55:59,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2024-10-15 00:55:59,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:55:59,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2024-10-15 00:55:59,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:55:59,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2024-10-15 00:55:59,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:55:59,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-10-15 00:55:59,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:55:59,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 25 transitions. [2024-10-15 00:55:59,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:55:59,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:55:59,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2024-10-15 00:55:59,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:55:59,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-10-15 00:55:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2024-10-15 00:55:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-15 00:55:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 00:55:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-15 00:55:59,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-15 00:55:59,925 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-15 00:55:59,926 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:55:59,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-15 00:55:59,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:55:59,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:55:59,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:55:59,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:55:59,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:55:59,928 INFO L745 eck$LassoCheckResult]: Stem: 119#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 113#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 112#$Ultimate##0 ~x := #in~x; 114#L18 assume !(~x > 100); 110#L21 call #t~ret4 := f91(11 + ~x);< 115#$Ultimate##0 ~x := #in~x; 116#L18 assume ~x > 100;#res := ~x - 10; 123#f91FINAL assume true; 109#f91EXIT >#29#return; 111#L21-1 [2024-10-15 00:55:59,928 INFO L747 eck$LassoCheckResult]: Loop: 111#L21-1 call #t~ret5 := f91(#t~ret4);< 118#$Ultimate##0 ~x := #in~x; 125#L18 assume !(~x > 100); 117#L21 call #t~ret4 := f91(11 + ~x);< 118#$Ultimate##0 ~x := #in~x; 125#L18 assume ~x > 100;#res := ~x - 10; 122#f91FINAL assume true; 124#f91EXIT >#29#return; 111#L21-1 [2024-10-15 00:55:59,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:59,929 INFO L85 PathProgramCache]: Analyzing trace with hash -218206616, now seen corresponding path program 1 times [2024-10-15 00:55:59,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:55:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003045865] [2024-10-15 00:55:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:55:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:55:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:59,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:55:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:59,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:55:59,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1767505954, now seen corresponding path program 1 times [2024-10-15 00:55:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:55:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055274159] [2024-10-15 00:55:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:55:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:55:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:59,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:55:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:55:59,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:55:59,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:55:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1919740023, now seen corresponding path program 1 times [2024-10-15 00:55:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:55:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369892231] [2024-10-15 00:55:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:55:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:00,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:56:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:00,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:56:00,183 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:00,183 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:00,183 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:00,183 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:00,184 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:56:00,184 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:00,184 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:00,184 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:00,184 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration2_Loop [2024-10-15 00:56:00,184 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:00,184 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:00,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:00,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:00,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:00,263 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:00,263 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:56:00,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:00,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:00,268 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-10-15 00:56:00,271 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-10-15 00:56:00,276 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-10-15 00:56:00,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:00,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:00,293 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:56:00,293 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret5=0} Honda state: {f91_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:56:00,307 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-10-15 00:56:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:00,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:00,309 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-10-15 00:56:00,311 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-10-15 00:56:00,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:00,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:00,333 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:56:00,333 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:56:00,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:56:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:00,351 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-10-15 00:56:00,369 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-10-15 00:56:00,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:00,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:00,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:00,425 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-10-15 00:56:00,427 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-10-15 00:56:00,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:56:00,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:12,468 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-15 00:56:12,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:12,481 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:12,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:12,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:12,482 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:12,482 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:56:12,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:12,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:12,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:12,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration2_Loop [2024-10-15 00:56:12,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:12,482 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:12,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:12,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:12,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:12,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:12,540 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:56:12,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:12,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:12,542 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-10-15 00:56:12,543 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-10-15 00:56:12,546 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-10-15 00:56:12,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:12,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:12,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:12,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:12,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:12,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:12,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:12,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:56:12,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:12,580 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-10-15 00:56:12,581 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-10-15 00:56:12,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:56:12,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:12,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:12,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:12,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:12,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:12,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:12,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:12,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:56:12,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:56:12,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:12,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:12,606 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-10-15 00:56:12,607 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-10-15 00:56:12,608 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-10-15 00:56:12,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:12,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:12,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:12,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:12,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:12,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:12,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:12,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:56:12,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:56:12,627 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:56:12,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:12,629 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-10-15 00:56:12,630 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-10-15 00:56:12,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:56:12,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:56:12,631 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:56:12,631 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2024-10-15 00:56:12,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:12,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:56:12,646 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2024-10-15 00:56:12,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:12,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:56:12,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:12,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:56:12,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:12,903 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:56:12,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:56:13,089 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 51 states and 73 transitions. Complement of second has 32 states. [2024-10-15 00:56:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:56:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-15 00:56:13,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-15 00:56:13,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:13,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2024-10-15 00:56:13,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:13,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2024-10-15 00:56:13,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:13,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2024-10-15 00:56:13,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:56:13,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 62 transitions. [2024-10-15 00:56:13,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-15 00:56:13,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-15 00:56:13,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2024-10-15 00:56:13,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:56:13,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-15 00:56:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2024-10-15 00:56:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-15 00:56:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-15 00:56:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-15 00:56:13,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-15 00:56:13,116 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-15 00:56:13,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:56:13,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2024-10-15 00:56:13,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:56:13,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:56:13,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:56:13,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:56:13,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:56:13,119 INFO L745 eck$LassoCheckResult]: Stem: 316#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 311#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 315#$Ultimate##0 ~x := #in~x; 321#L18 assume !(~x > 100); 306#L21 call #t~ret4 := f91(11 + ~x);< 304#$Ultimate##0 ~x := #in~x; 308#L18 assume ~x > 100;#res := ~x - 10; 326#f91FINAL assume true; 325#f91EXIT >#29#return; 296#L21-1 call #t~ret5 := f91(#t~ret4);< 313#$Ultimate##0 ~x := #in~x; 328#L18 assume !(~x > 100); 302#L21 [2024-10-15 00:56:13,119 INFO L747 eck$LassoCheckResult]: Loop: 302#L21 call #t~ret4 := f91(11 + ~x);< 301#$Ultimate##0 ~x := #in~x; 303#L18 assume !(~x > 100); 302#L21 [2024-10-15 00:56:13,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1987218266, now seen corresponding path program 2 times [2024-10-15 00:56:13,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:13,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644351611] [2024-10-15 00:56:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:13,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:56:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:13,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:56:13,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash 57247, now seen corresponding path program 2 times [2024-10-15 00:56:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478213981] [2024-10-15 00:56:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:13,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:56:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:13,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:56:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -609818202, now seen corresponding path program 3 times [2024-10-15 00:56:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102292775] [2024-10-15 00:56:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:13,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 00:56:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:56:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:56:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102292775] [2024-10-15 00:56:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102292775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:56:13,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:56:13,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 00:56:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413546915] [2024-10-15 00:56:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:56:13,387 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:13,387 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:13,387 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:13,387 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:13,387 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:56:13,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:13,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:13,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:13,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration3_Loop [2024-10-15 00:56:13,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:13,388 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:13,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:13,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:13,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:13,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:13,430 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:13,430 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:56:13,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:13,432 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-10-15 00:56:13,434 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-10-15 00:56:13,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:13,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:13,473 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-10-15 00:56:13,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:13,475 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-10-15 00:56:13,476 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-10-15 00:56:13,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:56:13,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:25,511 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-15 00:56:25,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-15 00:56:25,521 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:25,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:25,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:25,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:25,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:56:25,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:25,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:25,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:25,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration3_Loop [2024-10-15 00:56:25,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:25,521 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:25,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:25,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:25,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:25,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:25,571 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:25,571 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:56:25,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:25,574 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-10-15 00:56:25,575 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-10-15 00:56:25,576 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-10-15 00:56:25,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:25,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:25,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:25,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:25,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:25,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:25,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:25,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:56:25,601 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-10-15 00:56:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:25,602 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-10-15 00:56:25,603 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-10-15 00:56:25,604 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-10-15 00:56:25,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:25,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:25,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:25,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:25,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:25,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:25,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:25,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:56:25,623 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:56:25,624 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:56:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:25,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:25,626 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-10-15 00:56:25,628 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-10-15 00:56:25,630 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:56:25,630 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:56:25,630 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:56:25,630 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_~x) = -2*f91_~x + 189 Supporting invariants [] [2024-10-15 00:56:25,643 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-10-15 00:56:25,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:56:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:25,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:56:25,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:25,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:56:25,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:25,808 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:56:25,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:25,875 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-10-15 00:56:25,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:56:25,969 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2024-10-15 00:56:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-15 00:56:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-15 00:56:25,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:25,976 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:56:25,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:56:26,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:56:26,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:26,123 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:56:26,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:26,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2024-10-15 00:56:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-15 00:56:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-15 00:56:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:26,191 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:56:26,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:56:26,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:56:26,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:26,331 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:56:26,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:26,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 71 states and 100 transitions. Complement of second has 16 states. [2024-10-15 00:56:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-10-15 00:56:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-15 00:56:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2024-10-15 00:56:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2024-10-15 00:56:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:26,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 100 transitions. [2024-10-15 00:56:26,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-15 00:56:26,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 74 transitions. [2024-10-15 00:56:26,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-15 00:56:26,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-15 00:56:26,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2024-10-15 00:56:26,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:56:26,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-10-15 00:56:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2024-10-15 00:56:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2024-10-15 00:56:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-15 00:56:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-10-15 00:56:26,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-10-15 00:56:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:56:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:56:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:56:26,436 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:56:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:56:26,526 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-10-15 00:56:26,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2024-10-15 00:56:26,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-15 00:56:26,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 58 states and 75 transitions. [2024-10-15 00:56:26,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:56:26,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-15 00:56:26,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 75 transitions. [2024-10-15 00:56:26,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:56:26,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-10-15 00:56:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 75 transitions. [2024-10-15 00:56:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-15 00:56:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 13 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-15 00:56:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-10-15 00:56:26,540 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-15 00:56:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:56:26,542 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-15 00:56:26,542 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:56:26,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 74 transitions. [2024-10-15 00:56:26,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-15 00:56:26,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:56:26,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:56:26,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-15 00:56:26,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2024-10-15 00:56:26,546 INFO L745 eck$LassoCheckResult]: Stem: 853#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 849#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 852#$Ultimate##0 ~x := #in~x; 876#L18 assume !(~x > 100); 869#L21 call #t~ret4 := f91(11 + ~x);< 871#$Ultimate##0 ~x := #in~x; 873#L18 assume !(~x > 100); 868#L21 call #t~ret4 := f91(11 + ~x);< 872#$Ultimate##0 ~x := #in~x; 875#L18 assume ~x > 100;#res := ~x - 10; 874#f91FINAL assume true; 870#f91EXIT >#29#return; 843#L21-1 call #t~ret5 := f91(#t~ret4);< 842#$Ultimate##0 ~x := #in~x; 844#L18 assume ~x > 100;#res := ~x - 10; 861#f91FINAL assume true; 891#f91EXIT >#31#return; 838#L21-2 #res := #t~ret5;havoc #t~ret4;havoc #t~ret5; 888#f91FINAL assume true; 887#f91EXIT >#29#return; 836#L21-1 call #t~ret5 := f91(#t~ret4);< 850#$Ultimate##0 [2024-10-15 00:56:26,547 INFO L747 eck$LassoCheckResult]: Loop: 850#$Ultimate##0 ~x := #in~x; 879#L18 assume !(~x > 100); 847#L21 call #t~ret4 := f91(11 + ~x);< 845#$Ultimate##0 ~x := #in~x; 848#L18 assume !(~x > 100); 846#L21 call #t~ret4 := f91(11 + ~x);< 864#$Ultimate##0 ~x := #in~x; 885#L18 assume ~x > 100;#res := ~x - 10; 883#f91FINAL assume true; 881#f91EXIT >#29#return; 857#L21-1 call #t~ret5 := f91(#t~ret4);< 880#$Ultimate##0 ~x := #in~x; 877#L18 assume ~x > 100;#res := ~x - 10; 878#f91FINAL assume true; 889#f91EXIT >#31#return; 838#L21-2 #res := #t~ret5;havoc #t~ret4;havoc #t~ret5; 888#f91FINAL assume true; 887#f91EXIT >#29#return; 837#L21-1 call #t~ret5 := f91(#t~ret4);< 850#$Ultimate##0 [2024-10-15 00:56:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash -834951989, now seen corresponding path program 1 times [2024-10-15 00:56:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329991999] [2024-10-15 00:56:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:26,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:56:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:26,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:56:26,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -871747263, now seen corresponding path program 1 times [2024-10-15 00:56:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895469256] [2024-10-15 00:56:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:26,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:56:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:26,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:56:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash 418853943, now seen corresponding path program 2 times [2024-10-15 00:56:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627358351] [2024-10-15 00:56:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 00:56:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:56:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 00:56:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 00:56:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:56:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 00:56:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 00:56:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:56:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627358351] [2024-10-15 00:56:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627358351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:56:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459696707] [2024-10-15 00:56:26,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:56:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:56:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:26,882 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:56:26,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-15 00:56:26,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:56:26,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:56:26,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:56:26,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 00:56:26,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:56:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 00:56:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459696707] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:56:27,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:56:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2024-10-15 00:56:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040305726] [2024-10-15 00:56:27,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:56:27,364 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:27,364 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:27,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:27,364 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:27,364 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:56:27,364 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:27,365 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:27,365 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:27,365 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration4_Loop [2024-10-15 00:56:27,365 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:27,365 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:27,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,402 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:27,402 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:56:27,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:27,404 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-10-15 00:56:27,405 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-10-15 00:56:27,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:27,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:27,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:27,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:27,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:27,437 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-10-15 00:56:27,437 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-10-15 00:56:27,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:56:27,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:27,453 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:56:27,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-15 00:56:27,468 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:27,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:27,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:27,468 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:27,469 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:56:27,469 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:27,469 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:27,469 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:27,469 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration4_Loop [2024-10-15 00:56:27,469 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:27,469 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:27,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:27,506 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:27,506 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:56:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:27,508 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-10-15 00:56:27,510 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-10-15 00:56:27,514 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-10-15 00:56:27,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:27,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:27,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:27,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:27,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:27,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:27,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:27,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:56:27,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:56:27,532 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:56:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:27,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:27,534 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-10-15 00:56:27,534 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-10-15 00:56:27,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:56:27,535 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:56:27,535 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:56:27,535 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2024-10-15 00:56:27,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-15 00:56:27,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:56:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:27,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:56:27,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:27,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 00:56:27,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 00:56:28,038 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-15 00:56:28,038 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:56:28,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 49 states. [2024-10-15 00:56:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:56:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2024-10-15 00:56:28,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-15 00:56:28,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:28,416 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:56:28,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:28,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:56:28,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:28,578 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-10-15 00:56:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:28,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 00:56:28,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 00:56:28,809 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2024-10-15 00:56:28,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-15 00:56:29,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 39 states. [2024-10-15 00:56:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-15 00:56:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2024-10-15 00:56:29,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-15 00:56:29,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:29,076 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:56:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:29,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:56:29,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:29,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 00:56:29,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 00:56:29,468 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-15 00:56:29,468 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:56:30,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 431 states and 531 transitions. Complement of second has 224 states. [2024-10-15 00:56:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:56:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2024-10-15 00:56:30,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-15 00:56:30,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:30,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 41 letters. Loop has 19 letters. [2024-10-15 00:56:30,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:30,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 38 letters. [2024-10-15 00:56:30,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:30,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 531 transitions. [2024-10-15 00:56:30,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2024-10-15 00:56:30,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 203 states and 269 transitions. [2024-10-15 00:56:30,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-15 00:56:30,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2024-10-15 00:56:30,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 269 transitions. [2024-10-15 00:56:30,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:56:30,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 269 transitions. [2024-10-15 00:56:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 269 transitions. [2024-10-15 00:56:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 157. [2024-10-15 00:56:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 97 states have (on average 1.092783505154639) internal successors, (106), 99 states have internal predecessors, (106), 35 states have call successors, (45), 29 states have call predecessors, (45), 25 states have return successors, (47), 28 states have call predecessors, (47), 32 states have call successors, (47) [2024-10-15 00:56:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2024-10-15 00:56:30,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 198 transitions. [2024-10-15 00:56:30,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:56:30,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 00:56:30,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-15 00:56:30,182 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-15 00:56:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:56:30,358 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2024-10-15 00:56:30,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 188 transitions. [2024-10-15 00:56:30,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:56:30,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 104 states and 123 transitions. [2024-10-15 00:56:30,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-10-15 00:56:30,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-10-15 00:56:30,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 123 transitions. [2024-10-15 00:56:30,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:56:30,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-10-15 00:56:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 123 transitions. [2024-10-15 00:56:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-10-15 00:56:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 64 states have internal predecessors, (66), 21 states have call successors, (28), 20 states have call predecessors, (28), 16 states have return successors, (25), 15 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-15 00:56:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-10-15 00:56:30,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-15 00:56:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 00:56:30,374 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-15 00:56:30,374 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:56:30,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 119 transitions. [2024-10-15 00:56:30,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:56:30,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:56:30,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:56:30,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2024-10-15 00:56:30,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:56:30,377 INFO L745 eck$LassoCheckResult]: Stem: 3022#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 3023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 3020#L28 call main_#t~ret7#1 := f91(main_~x~0#1);< 3021#$Ultimate##0 ~x := #in~x; 3033#L18 assume !(~x > 100); 3034#L21 call #t~ret4 := f91(11 + ~x);< 3037#$Ultimate##0 ~x := #in~x; 3050#L18 assume !(~x > 100); 3044#L21 call #t~ret4 := f91(11 + ~x);< 3048#$Ultimate##0 ~x := #in~x; 3051#L18 assume ~x > 100;#res := ~x - 10; 3049#f91FINAL assume true; 3047#f91EXIT >#29#return; 3043#L21-1 call #t~ret5 := f91(#t~ret4);< 3045#$Ultimate##0 ~x := #in~x; 3077#L18 assume ~x > 100;#res := ~x - 10; 3064#f91FINAL assume true; 3063#f91EXIT >#31#return; 3061#L21-2 #res := #t~ret5;havoc #t~ret4;havoc #t~ret5; 3060#f91FINAL assume true; 3059#f91EXIT >#29#return; 3052#L21-1 call #t~ret5 := f91(#t~ret4);< 3058#$Ultimate##0 ~x := #in~x; 3056#L18 assume !(~x > 100); 3015#L21 call #t~ret4 := f91(11 + ~x);< 3014#$Ultimate##0 ~x := #in~x; 3016#L18 assume !(~x > 100); 3004#L21 call #t~ret4 := f91(11 + ~x);< 3055#$Ultimate##0 ~x := #in~x; 3102#L18 assume ~x > 100;#res := ~x - 10; 3101#f91FINAL assume true; 3003#f91EXIT >#29#return; 3005#L21-1 [2024-10-15 00:56:30,377 INFO L747 eck$LassoCheckResult]: Loop: 3005#L21-1 call #t~ret5 := f91(#t~ret4);< 3017#$Ultimate##0 ~x := #in~x; 3099#L18 assume !(~x > 100); 3035#L21 call #t~ret4 := f91(11 + ~x);< 3036#$Ultimate##0 ~x := #in~x; 3097#L18 assume ~x > 100;#res := ~x - 10; 3096#f91FINAL assume true; 3095#f91EXIT >#29#return; 3005#L21-1 [2024-10-15 00:56:30,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2083076242, now seen corresponding path program 3 times [2024-10-15 00:56:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569580873] [2024-10-15 00:56:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 00:56:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:56:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 00:56:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 00:56:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-15 00:56:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:56:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569580873] [2024-10-15 00:56:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569580873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:56:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048804799] [2024-10-15 00:56:30,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:56:30,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:56:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:30,505 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:56:30,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-15 00:56:30,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-15 00:56:30,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:56:30,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:56:30,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 00:56:30,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 00:56:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048804799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:56:30,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 00:56:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2024-10-15 00:56:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716616163] [2024-10-15 00:56:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:56:30,571 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:56:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1767505954, now seen corresponding path program 2 times [2024-10-15 00:56:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:56:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234718794] [2024-10-15 00:56:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:56:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:56:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:30,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:56:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:56:30,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:56:30,672 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:30,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:30,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:30,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:30,672 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:56:30,672 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:30,672 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:30,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:30,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration5_Loop [2024-10-15 00:56:30,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:30,673 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:30,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:30,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:30,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:30,708 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:30,708 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:56:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:30,710 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-10-15 00:56:30,710 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-10-15 00:56:30,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:30,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:30,722 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:56:30,722 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:56:30,733 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-10-15 00:56:30,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:30,734 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-10-15 00:56:30,735 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-10-15 00:56:30,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:56:30,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:30,768 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-10-15 00:56:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:30,770 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-10-15 00:56:30,770 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-10-15 00:56:30,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:56:30,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:56:42,812 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-15 00:56:42,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:42,821 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:56:42,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:56:42,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:56:42,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:56:42,822 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:56:42,822 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:42,822 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:56:42,822 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:56:42,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-2.c_Iteration5_Loop [2024-10-15 00:56:42,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:56:42,822 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:56:42,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:42,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:42,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:56:42,866 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:56:42,866 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:56:42,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:42,868 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-10-15 00:56:42,870 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-10-15 00:56:42,871 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-10-15 00:56:42,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:42,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:42,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:42,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:42,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:42,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:42,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:42,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:56:42,902 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-10-15 00:56:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:42,905 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-10-15 00:56:42,906 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-10-15 00:56:42,907 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-10-15 00:56:42,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:56:42,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:56:42,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:56:42,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:56:42,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:56:42,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:56:42,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:56:42,926 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:56:42,929 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:56:42,929 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:56:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:56:42,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:56:42,933 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-10-15 00:56:42,934 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-10-15 00:56:42,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:56:42,935 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:56:42,935 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:56:42,935 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2024-10-15 00:56:42,948 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-10-15 00:56:42,949 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:56:42,950 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2024-10-15 00:56:42,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:43,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:56:43,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:43,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:56:43,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:43,256 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:56:43,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:56:43,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2024-10-15 00:56:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:56:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-15 00:56:43,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-15 00:56:43,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:43,381 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:56:43,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:43,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:56:43,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:43,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:56:43,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:43,690 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:56:43,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:56:43,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2024-10-15 00:56:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:56:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-15 00:56:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-15 00:56:43,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:43,827 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:56:43,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:43,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:56:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:43,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:56:43,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:56:44,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:56:44,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:56:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:56:44,142 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:56:44,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:56:44,301 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 181 states and 211 transitions. Complement of second has 27 states. [2024-10-15 00:56:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:56:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:56:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2024-10-15 00:56:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-15 00:56:44,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 40 letters. Loop has 8 letters. [2024-10-15 00:56:44,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 16 letters. [2024-10-15 00:56:44,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:56:44,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 211 transitions. [2024-10-15 00:56:44,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:56:44,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 0 states and 0 transitions. [2024-10-15 00:56:44,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:56:44,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:56:44,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:56:44,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:56:44,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:56:44,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:56:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:56:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 00:56:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-15 00:56:44,307 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 00:56:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:56:44,308 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-15 00:56:44,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-15 00:56:44,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:56:44,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 00:56:44,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:56:44,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:56:44,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:56:44,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:56:44,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:56:44,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:56:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:56:44,309 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:56:44,309 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:56:44,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:56:44,309 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:56:44,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:56:44,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:56:44 BoogieIcfgContainer [2024-10-15 00:56:44,317 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:56:44,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:56:44,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:56:44,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:56:44,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:58" (3/4) ... [2024-10-15 00:56:44,320 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:56:44,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:56:44,322 INFO L158 Benchmark]: Toolchain (without parser) took 46377.08ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 100.0MB in the beginning and 97.5MB in the end (delta: 2.5MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-10-15 00:56:44,322 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:56:44,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.16ms. Allocated memory is still 151.0MB. Free memory was 99.5MB in the beginning and 88.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:56:44,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.71ms. Allocated memory is still 151.0MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:56:44,323 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 85.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:56:44,323 INFO L158 Benchmark]: RCFGBuilder took 314.48ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 117.9MB in the end (delta: -32.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:56:44,323 INFO L158 Benchmark]: BuchiAutomizer took 45770.51ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 117.9MB in the beginning and 97.5MB in the end (delta: 20.4MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-10-15 00:56:44,323 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 182.5MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:56:44,325 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.15ms. Allocated memory is still 96.5MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.16ms. Allocated memory is still 151.0MB. Free memory was 99.5MB in the beginning and 88.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.71ms. Allocated memory is still 151.0MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 85.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.48ms. Allocated memory is still 151.0MB. Free memory was 85.9MB in the beginning and 117.9MB in the end (delta: -32.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 45770.51ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 117.9MB in the beginning and 97.5MB in the end (delta: 20.4MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 182.5MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (211 + ((long long) -2 * \old(x))) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -2 * x) + 189) and consists of 6 locations. One nondeterministic module has affine ranking function (((long long) -1 * \old(x)) + 90) and consists of 21 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.7s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 39.8s. Construction of modules took 0.7s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 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 [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 170 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 36.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:56:44,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-15 00:56:44,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-15 00:56:44,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE