./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:59:16,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:59:16,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:59:16,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:59:16,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:59:16,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:59:16,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:59:16,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:59:16,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:59:16,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:59:16,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:59:16,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:59:16,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:59:16,375 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:59:16,377 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:59:16,377 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:59:16,378 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:59:16,378 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:59:16,378 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:59:16,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:59:16,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:59:16,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:59:16,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:59:16,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:59:16,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:59:16,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:59:16,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:59:16,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:59:16,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:59:16,385 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:59:16,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:59:16,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:59:16,385 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:59:16,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:59:16,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:59:16,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:59:16,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:59:16,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:59:16,388 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:59:16,388 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-clean/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-clean/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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2024-10-12 00:59:16,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:59:16,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:59:16,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:59:16,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:59:16,702 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:59:16,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2024-10-12 00:59:18,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:59:18,289 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:59:18,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2024-10-12 00:59:18,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5feb0f53/c62e2c55e84449ba880e2e182b21772e/FLAG1d3a2df12 [2024-10-12 00:59:18,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5feb0f53/c62e2c55e84449ba880e2e182b21772e [2024-10-12 00:59:18,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:59:18,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:59:18,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:59:18,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:59:18,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:59:18,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617f2e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18, skipping insertion in model container [2024-10-12 00:59:18,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:59:18,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:59:18,887 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:59:18,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:59:18,913 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:59:18,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18 WrapperNode [2024-10-12 00:59:18,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:59:18,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:59:18,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:59:18,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:59:18,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,948 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-12 00:59:18,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:59:18,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:59:18,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:59:18,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:59:18,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,973 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-12 00:59:18,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:59:18,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:59:18,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:59:18,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:59:18,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (1/1) ... [2024-10-12 00:59:18,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:19,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:19,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:59:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-10-12 00:59:19,082 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-10-12 00:59:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:59:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:59:19,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:59:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:59:19,144 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:59:19,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:59:19,289 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 00:59:19,289 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:59:19,300 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:59:19,300 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 00:59:19,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:59:19 BoogieIcfgContainer [2024-10-12 00:59:19,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:59:19,301 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:59:19,302 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:59:19,306 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:59:19,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:59:19,307 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:59:18" (1/3) ... [2024-10-12 00:59:19,308 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c75c2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:59:19, skipping insertion in model container [2024-10-12 00:59:19,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:59:19,308 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:59:18" (2/3) ... [2024-10-12 00:59:19,309 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c75c2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:59:19, skipping insertion in model container [2024-10-12 00:59:19,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:59:19,310 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:59:19" (3/3) ... [2024-10-12 00:59:19,311 INFO L332 chiAutomizerObserver]: Analyzing ICFG Fibonacci05.c [2024-10-12 00:59:19,358 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:59:19,358 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:59:19,358 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:59:19,358 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:59:19,359 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:59:19,359 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:59:19,359 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:59:19,359 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:59:19,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-12 00:59:19,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:19,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:19,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:19,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:59:19,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:59:19,383 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:59:19,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-12 00:59:19,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:19,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:19,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:19,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:59:19,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:59:19,391 INFO L745 eck$LassoCheckResult]: Stem: 17#$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(14, 2);call #Ultimate.allocInit(12, 3); 12#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; 8#L29true call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 14#$Ultimate##0true [2024-10-12 00:59:19,392 INFO L747 eck$LassoCheckResult]: Loop: 14#$Ultimate##0true ~n := #in~n; 4#L17true assume !(~n < 1); 18#L19true assume !(1 == ~n); 16#L22true call #t~ret4 := fibonacci(~n - 1);< 14#$Ultimate##0true [2024-10-12 00:59:19,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash 42783, now seen corresponding path program 1 times [2024-10-12 00:59:19,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193558645] [2024-10-12 00:59:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:19,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:19,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:19,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 1 times [2024-10-12 00:59:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379590179] [2024-10-12 00:59:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:19,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:19,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 856297401, now seen corresponding path program 1 times [2024-10-12 00:59:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620482979] [2024-10-12 00:59:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:19,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:19,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:19,693 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:19,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:19,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:19,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:19,694 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:59:19,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:19,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:19,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration1_Loop [2024-10-12 00:59:19,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:19,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:19,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:19,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:19,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:19,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:19,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:19,811 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:19,811 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:59:19,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:19,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:19,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:59:19,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:19,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:19,839 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:19,840 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:19,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:59:19,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:19,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:19,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:59:19,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:19,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:19,868 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:19,868 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:19,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:59:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:19,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:19,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:59:19,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:19,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:19,898 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:19,898 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:19,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:19,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:19,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:59:19,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:19,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:19,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:19,968 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:19,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:59:19,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:59:19,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:20,037 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:59:20,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:20,043 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:20,043 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:20,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:20,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:20,043 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:59:20,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:20,043 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:20,043 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:20,044 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration1_Loop [2024-10-12 00:59:20,044 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:20,044 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:20,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:20,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:20,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:20,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:20,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:20,123 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:20,129 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:59:20,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:20,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:20,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:59:20,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:59:20,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:20,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:20,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:20,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:20,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:20,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:20,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:20,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:20,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:59:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:20,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:20,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:20,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:59:20,180 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-12 00:59:20,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:20,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:20,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:20,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:20,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:20,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:20,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:20,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:20,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:20,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:20,219 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:20,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:59:20,222 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-12 00:59:20,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:20,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:20,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:20,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:20,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:20,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:20,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:20,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:20,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:59:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:20,259 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:20,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:59:20,262 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-12 00:59:20,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:20,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:20,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:20,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:20,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:20,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:20,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:20,278 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:59:20,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:59:20,283 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:59:20,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:20,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:20,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:20,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:59:20,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:59:20,307 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:59:20,307 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:59:20,308 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2024-10-12 00:59:20,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:59:20,327 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:59:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:20,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:59:20,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:20,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:20,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:20,461 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-12 00:59:20,494 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-12 00:59:20,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-12 00:59:20,594 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 40 states and 53 transitions. Complement of second has 16 states. [2024-10-12 00:59:20,598 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-12 00:59:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-12 00:59:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-10-12 00:59:20,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-12 00:59:20,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:20,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-12 00:59:20,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:20,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-12 00:59:20,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:20,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2024-10-12 00:59:20,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:20,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 23 states and 31 transitions. [2024-10-12 00:59:20,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:59:20,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:59:20,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2024-10-12 00:59:20,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:20,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-12 00:59:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2024-10-12 00:59:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-12 00:59:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-12 00:59:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-12 00:59:20,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-12 00:59:20,656 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-12 00:59:20,656 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:59:20,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-10-12 00:59:20,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:20,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:20,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:20,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:59:20,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:59:20,661 INFO L745 eck$LassoCheckResult]: Stem: 130#$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(14, 2);call #Ultimate.allocInit(12, 3); 131#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; 120#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 132#$Ultimate##0 ~n := #in~n; 126#L17 assume !(~n < 1); 127#L19 assume !(1 == ~n); 119#L22 call #t~ret4 := fibonacci(~n - 1);< 128#$Ultimate##0 ~n := #in~n; 123#L17 assume ~n < 1;#res := 0; 124#fibonacciFINAL assume true; 129#fibonacciEXIT >#31#return; 118#L22-1 [2024-10-12 00:59:20,661 INFO L747 eck$LassoCheckResult]: Loop: 118#L22-1 call #t~ret5 := fibonacci(~n - 2);< 122#$Ultimate##0 ~n := #in~n; 137#L17 assume !(~n < 1); 136#L19 assume !(1 == ~n); 121#L22 call #t~ret4 := fibonacci(~n - 1);< 122#$Ultimate##0 ~n := #in~n; 137#L17 assume ~n < 1;#res := 0; 134#fibonacciFINAL assume true; 135#fibonacciEXIT >#31#return; 118#L22-1 [2024-10-12 00:59:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2073663503, now seen corresponding path program 1 times [2024-10-12 00:59:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:20,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644160861] [2024-10-12 00:59:20,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:59:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:59:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:59:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644160861] [2024-10-12 00:59:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644160861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:59:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:59:20,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:59:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096498078] [2024-10-12 00:59:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:59:20,857 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:59:20,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:20,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1606275375, now seen corresponding path program 1 times [2024-10-12 00:59:20,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:20,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013649674] [2024-10-12 00:59:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 00:59:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:59:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:59:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013649674] [2024-10-12 00:59:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013649674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:59:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:59:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:59:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847446274] [2024-10-12 00:59:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:59:20,964 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:59:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:59:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:59:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:59:20,968 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 00:59:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:59:21,043 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-10-12 00:59:21,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-10-12 00:59:21,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:21,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 30 transitions. [2024-10-12 00:59:21,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-12 00:59:21,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:59:21,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2024-10-12 00:59:21,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:21,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 00:59:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2024-10-12 00:59:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 00:59:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 00:59:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-12 00:59:21,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 00:59:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:59:21,052 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 00:59:21,052 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:59:21,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2024-10-12 00:59:21,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:21,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:21,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:21,065 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:59:21,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:59:21,065 INFO L745 eck$LassoCheckResult]: Stem: 202#$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(14, 2);call #Ultimate.allocInit(12, 3); 203#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; 191#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 201#$Ultimate##0 ~n := #in~n; 196#L17 assume !(~n < 1); 197#L19 assume !(1 == ~n); 192#L22 call #t~ret4 := fibonacci(~n - 1);< 198#$Ultimate##0 ~n := #in~n; 194#L17 assume !(~n < 1); 195#L19 assume 1 == ~n;#res := 1; 205#fibonacciFINAL assume true; 208#fibonacciEXIT >#31#return; 189#L22-1 [2024-10-12 00:59:21,066 INFO L747 eck$LassoCheckResult]: Loop: 189#L22-1 call #t~ret5 := fibonacci(~n - 2);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume !(1 == ~n); 190#L22 call #t~ret4 := fibonacci(~n - 1);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume !(1 == ~n); 190#L22 call #t~ret4 := fibonacci(~n - 1);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume !(~n < 1); 209#L19 assume 1 == ~n;#res := 1; 210#fibonacciFINAL assume true; 207#fibonacciEXIT >#31#return; 189#L22-1 call #t~ret5 := fibonacci(~n - 2);< 193#$Ultimate##0 ~n := #in~n; 211#L17 assume ~n < 1;#res := 0; 212#fibonacciFINAL assume true; 199#fibonacciEXIT >#33#return; 200#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 204#fibonacciFINAL assume true; 206#fibonacciEXIT >#31#return; 189#L22-1 [2024-10-12 00:59:21,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -140916419, now seen corresponding path program 1 times [2024-10-12 00:59:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155085946] [2024-10-12 00:59:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:21,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:21,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:59:21,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:21,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1749360471, now seen corresponding path program 1 times [2024-10-12 00:59:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:21,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972617466] [2024-10-12 00:59:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:21,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:21,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:21,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:21,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash 998757605, now seen corresponding path program 1 times [2024-10-12 00:59:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986641848] [2024-10-12 00:59:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:21,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:59:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 00:59:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 00:59:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:59:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986641848] [2024-10-12 00:59:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986641848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:59:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958549602] [2024-10-12 00:59:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:59:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:21,310 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:59:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-12 00:59:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:21,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:59:21,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 00:59:21,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:59:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 00:59:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958549602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:59:21,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:59:21,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-12 00:59:21,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428492173] [2024-10-12 00:59:21,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:59:21,758 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:21,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:21,758 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:21,758 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:21,758 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:59:21,759 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:21,759 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:21,759 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:21,759 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration3_Loop [2024-10-12 00:59:21,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:21,759 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:21,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,820 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:21,820 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:59:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:21,824 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:21,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:59:21,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:21,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:21,842 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:21,843 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#in~n=3} Honda state: {fibonacci_#in~n=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:21,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:21,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:21,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:21,856 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:21,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:59:21,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:21,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:21,869 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:21,870 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:21,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:21,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:59:21,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:21,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:21,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:21,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:21,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:21,906 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:21,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:59:21,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:59:21,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:21,920 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:59:21,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:21,936 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:21,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:21,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:21,936 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:21,936 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:59:21,936 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:21,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:21,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:21,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration3_Loop [2024-10-12 00:59:21,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:21,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:21,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:21,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:22,005 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:22,005 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:59:22,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:22,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:22,006 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:59:22,008 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-12 00:59:22,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:22,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:22,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:22,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:22,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:22,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:22,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:22,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:22,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:59:22,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:22,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:22,033 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:22,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:59:22,035 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-12 00:59:22,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:22,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:22,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:22,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:22,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:22,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:22,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:22,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:22,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:22,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:22,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:22,060 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:22,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:59:22,062 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-12 00:59:22,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:22,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:22,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:22,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:22,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:22,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:22,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:22,075 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:59:22,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:59:22,078 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:59:22,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:22,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:22,080 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:22,087 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:59:22,087 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:59:22,088 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:59:22,088 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-10-12 00:59:22,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:59:22,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:59:22,102 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:59:22,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:59:22,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:59:22,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:59:22,412 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-12 00:59:22,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 00:59:22,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:22,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 8. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Result 152 states and 210 transitions. Complement of second has 54 states. [2024-10-12 00:59:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-10-12 00:59:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 00:59:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2024-10-12 00:59:22,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 12 letters. Loop has 22 letters. [2024-10-12 00:59:22,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:22,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 34 letters. Loop has 22 letters. [2024-10-12 00:59:22,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:22,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 40 transitions. Stem has 12 letters. Loop has 44 letters. [2024-10-12 00:59:22,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:22,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 210 transitions. [2024-10-12 00:59:22,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-10-12 00:59:22,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 125 states and 179 transitions. [2024-10-12 00:59:22,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-10-12 00:59:22,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-10-12 00:59:22,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 179 transitions. [2024-10-12 00:59:22,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:22,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 179 transitions. [2024-10-12 00:59:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 179 transitions. [2024-10-12 00:59:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2024-10-12 00:59:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 70 states have internal predecessors, (81), 25 states have call successors, (26), 13 states have call predecessors, (26), 15 states have return successors, (35), 22 states have call predecessors, (35), 23 states have call successors, (35) [2024-10-12 00:59:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2024-10-12 00:59:22,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 142 transitions. [2024-10-12 00:59:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:59:22,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:59:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:59:22,719 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 00:59:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:59:22,781 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-10-12 00:59:22,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2024-10-12 00:59:22,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:22,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 53 transitions. [2024-10-12 00:59:22,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-10-12 00:59:22,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-12 00:59:22,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2024-10-12 00:59:22,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:22,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-10-12 00:59:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2024-10-12 00:59:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-10-12 00:59:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-12 00:59:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-12 00:59:22,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-12 00:59:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:59:22,790 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-12 00:59:22,790 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:59:22,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-10-12 00:59:22,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:59:22,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:22,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:22,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:59:22,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:59:22,793 INFO L745 eck$LassoCheckResult]: Stem: 959#$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(14, 2);call #Ultimate.allocInit(12, 3); 960#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; 952#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 961#$Ultimate##0 ~n := #in~n; 951#L17 assume !(~n < 1); 953#L19 assume !(1 == ~n); 955#L22 call #t~ret4 := fibonacci(~n - 1);< 956#$Ultimate##0 ~n := #in~n; 967#L17 assume !(~n < 1); 981#L19 assume !(1 == ~n); 962#L22 call #t~ret4 := fibonacci(~n - 1);< 956#$Ultimate##0 ~n := #in~n; 966#L17 assume !(~n < 1); 964#L19 assume 1 == ~n;#res := 1; 965#fibonacciFINAL assume true; 979#fibonacciEXIT >#31#return; 976#L22-1 call #t~ret5 := fibonacci(~n - 2);< 977#$Ultimate##0 ~n := #in~n; 980#L17 assume ~n < 1;#res := 0; 978#fibonacciFINAL assume true; 975#fibonacciEXIT >#33#return; 974#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 973#fibonacciFINAL assume true; 972#fibonacciEXIT >#31#return; 947#L22-1 [2024-10-12 00:59:22,793 INFO L747 eck$LassoCheckResult]: Loop: 947#L22-1 call #t~ret5 := fibonacci(~n - 2);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume !(1 == ~n); 946#L22 call #t~ret4 := fibonacci(~n - 1);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume !(1 == ~n); 946#L22 call #t~ret4 := fibonacci(~n - 1);< 954#$Ultimate##0 ~n := #in~n; 970#L17 assume !(~n < 1); 968#L19 assume 1 == ~n;#res := 1; 969#fibonacciFINAL assume true; 982#fibonacciEXIT >#31#return; 945#L22-1 call #t~ret5 := fibonacci(~n - 2);< 948#$Ultimate##0 ~n := #in~n; 949#L17 assume ~n < 1;#res := 0; 950#fibonacciFINAL assume true; 957#fibonacciEXIT >#33#return; 958#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 963#fibonacciFINAL assume true; 971#fibonacciEXIT >#31#return; 947#L22-1 [2024-10-12 00:59:22,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 62997961, now seen corresponding path program 2 times [2024-10-12 00:59:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:22,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101199503] [2024-10-12 00:59:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:22,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:22,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1749360471, now seen corresponding path program 2 times [2024-10-12 00:59:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371566834] [2024-10-12 00:59:22,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:22,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:22,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:22,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 969547889, now seen corresponding path program 3 times [2024-10-12 00:59:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107061290] [2024-10-12 00:59:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:59:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 00:59:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-12 00:59:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:59:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107061290] [2024-10-12 00:59:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107061290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:59:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707517771] [2024-10-12 00:59:22,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:59:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:59:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:22,996 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:59:22,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-12 00:59:23,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-12 00:59:23,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:59:23,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:59:23,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-12 00:59:23,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:59:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 00:59:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707517771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:59:23,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:59:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 21 [2024-10-12 00:59:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738186880] [2024-10-12 00:59:23,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:59:23,680 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:23,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:23,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:23,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:23,681 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:59:23,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,681 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:23,681 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:23,681 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration4_Loop [2024-10-12 00:59:23,681 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:23,682 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:23,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,729 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:23,729 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:59:23,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,731 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:59:23,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:23,736 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:23,751 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:23,751 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#in~n=3} Honda state: {fibonacci_#in~n=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:23,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:59:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,773 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:59:23,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:23,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:23,792 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:23,792 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:23,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:59:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,808 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:59:23,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:23,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:23,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:59:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,832 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:59:23,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:59:23,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:23,847 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:59:23,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-12 00:59:23,862 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:23,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:23,862 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:23,862 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:23,862 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:59:23,862 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,862 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:23,862 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:23,862 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration4_Loop [2024-10-12 00:59:23,862 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:23,862 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:23,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:23,919 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:23,919 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:59:23,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,922 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:59:23,924 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-12 00:59:23,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:23,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:23,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:23,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:23,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:23,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:23,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:23,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:23,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:23,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,948 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:59:23,949 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-12 00:59:23,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:23,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:23,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:23,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:23,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:23,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:23,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:23,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:59:23,964 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:59:23,964 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:59:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:23,965 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:23,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:59:23,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:59:23,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:59:23,967 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:59:23,967 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-10-12 00:59:23,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:59:23,977 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:59:23,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:24,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:24,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:59:24,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:24,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:59:24,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:59:24,368 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-12 00:59:24,369 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 00:59:24,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 45 states and 54 transitions. Complement of second has 11 states. [2024-10-12 00:59:24,477 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-12 00:59:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 00:59:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-12 00:59:24,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2024-10-12 00:59:24,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:24,479 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:59:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:24,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:59:24,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:24,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:59:24,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:59:24,839 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-12 00:59:24,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 00:59:24,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 45 states and 54 transitions. Complement of second has 11 states. [2024-10-12 00:59:24,932 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-12 00:59:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 00:59:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-12 00:59:24,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 24 letters. Loop has 22 letters. [2024-10-12 00:59:24,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:24,934 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:59:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:24,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:59:24,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:25,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:59:25,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:59:25,258 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-12 00:59:25,259 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 00:59:25,506 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 47 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 331 states and 432 transitions. Complement of second has 134 states. [2024-10-12 00:59:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2024-10-12 00:59:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 00:59:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2024-10-12 00:59:25,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 24 letters. Loop has 22 letters. [2024-10-12 00:59:25,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:25,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 46 letters. Loop has 22 letters. [2024-10-12 00:59:25,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:25,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 24 letters. Loop has 44 letters. [2024-10-12 00:59:25,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:25,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 432 transitions. [2024-10-12 00:59:25,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:25,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 215 states and 294 transitions. [2024-10-12 00:59:25,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2024-10-12 00:59:25,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-10-12 00:59:25,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 294 transitions. [2024-10-12 00:59:25,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:25,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-10-12 00:59:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 294 transitions. [2024-10-12 00:59:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 173. [2024-10-12 00:59:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 113 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 28 states have return successors, (61), 36 states have call predecessors, (61), 36 states have call successors, (61) [2024-10-12 00:59:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2024-10-12 00:59:25,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 225 transitions. [2024-10-12 00:59:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:59:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 00:59:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-12 00:59:25,547 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 21 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 13 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2024-10-12 00:59:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:59:25,808 INFO L93 Difference]: Finished difference Result 344 states and 500 transitions. [2024-10-12 00:59:25,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 500 transitions. [2024-10-12 00:59:25,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:25,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 334 states and 487 transitions. [2024-10-12 00:59:25,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2024-10-12 00:59:25,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2024-10-12 00:59:25,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 334 states and 487 transitions. [2024-10-12 00:59:25,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:25,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 334 states and 487 transitions. [2024-10-12 00:59:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 487 transitions. [2024-10-12 00:59:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 265. [2024-10-12 00:59:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 164 states have (on average 1.1341463414634145) internal successors, (186), 166 states have internal predecessors, (186), 60 states have call successors, (72), 35 states have call predecessors, (72), 41 states have return successors, (136), 63 states have call predecessors, (136), 58 states have call successors, (136) [2024-10-12 00:59:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2024-10-12 00:59:25,854 INFO L240 hiAutomatonCegarLoop]: Abstraction has 265 states and 394 transitions. [2024-10-12 00:59:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 00:59:25,855 INFO L425 stractBuchiCegarLoop]: Abstraction has 265 states and 394 transitions. [2024-10-12 00:59:25,855 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:59:25,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 394 transitions. [2024-10-12 00:59:25,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:25,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:25,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:25,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 9, 7, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1] [2024-10-12 00:59:25,862 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:59:25,862 INFO L745 eck$LassoCheckResult]: Stem: 2933#$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(14, 2);call #Ultimate.allocInit(12, 3); 2934#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; 2935#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 2936#$Ultimate##0 ~n := #in~n; 2982#L17 assume !(~n < 1); 2980#L19 assume !(1 == ~n); 2972#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2981#L17 assume !(~n < 1); 2979#L19 assume !(1 == ~n); 2973#L22 call #t~ret4 := fibonacci(~n - 1);< 2975#$Ultimate##0 ~n := #in~n; 2983#L17 assume !(~n < 1); 3109#L19 assume 1 == ~n;#res := 1; 3107#fibonacciFINAL assume true; 3104#fibonacciEXIT >#31#return; 3101#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3102#$Ultimate##0 ~n := #in~n; 3108#L17 assume ~n < 1;#res := 0; 3106#fibonacciFINAL assume true; 3100#fibonacciEXIT >#33#return; 3098#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3097#fibonacciFINAL assume true; 3094#fibonacciEXIT >#31#return; 3006#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3007#$Ultimate##0 ~n := #in~n; 3053#L17 assume !(~n < 1); 3021#L19 assume 1 == ~n;#res := 1; 2960#fibonacciFINAL assume true; 3004#fibonacciEXIT >#33#return; 3002#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2997#fibonacciFINAL assume true; 2988#fibonacciEXIT >#31#return; 2987#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2990#$Ultimate##0 ~n := #in~n; 3064#L17 assume !(~n < 1); 3019#L19 assume !(1 == ~n); 3020#L22 call #t~ret4 := fibonacci(~n - 1);< 3167#$Ultimate##0 ~n := #in~n; 3113#L17 assume !(~n < 1); 3115#L19 assume 1 == ~n;#res := 1; 3168#fibonacciFINAL assume true; 3165#fibonacciEXIT >#31#return; 2950#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2949#$Ultimate##0 ~n := #in~n; 2952#L17 assume ~n < 1;#res := 0; 3009#fibonacciFINAL assume true; 3000#fibonacciEXIT >#33#return; 3001#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2996#fibonacciFINAL assume true; 2986#fibonacciEXIT >#33#return; 2974#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 2977#fibonacciFINAL assume true; 2971#fibonacciEXIT >#31#return; 2965#L22-1 call #t~ret5 := fibonacci(~n - 2);< 2966#$Ultimate##0 ~n := #in~n; 3172#L17 assume !(~n < 1); 3171#L19 assume !(1 == ~n); 3127#L22 call #t~ret4 := fibonacci(~n - 1);< 3166#$Ultimate##0 ~n := #in~n; 3142#L17 assume !(~n < 1); 3143#L19 assume !(1 == ~n); 3122#L22 call #t~ret4 := fibonacci(~n - 1);< 3128#$Ultimate##0 [2024-10-12 00:59:25,862 INFO L747 eck$LassoCheckResult]: Loop: 3128#$Ultimate##0 ~n := #in~n; 3140#L17 assume !(~n < 1); 3138#L19 assume !(1 == ~n); 3124#L22 call #t~ret4 := fibonacci(~n - 1);< 3128#$Ultimate##0 [2024-10-12 00:59:25,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -627327765, now seen corresponding path program 4 times [2024-10-12 00:59:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680532081] [2024-10-12 00:59:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:25,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:25,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 927643, now seen corresponding path program 2 times [2024-10-12 00:59:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988313433] [2024-10-12 00:59:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:25,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:25,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:25,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2068668293, now seen corresponding path program 5 times [2024-10-12 00:59:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964913019] [2024-10-12 00:59:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:59:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 00:59:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 00:59:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-12 00:59:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:59:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964913019] [2024-10-12 00:59:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964913019] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:59:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866033664] [2024-10-12 00:59:26,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 00:59:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:59:26,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:26,293 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:59:26,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-12 00:59:26,348 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-12 00:59:26,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:59:26,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 00:59:26,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-12 00:59:26,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:59:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 130 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-12 00:59:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866033664] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:59:26,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:59:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 20 [2024-10-12 00:59:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10761261] [2024-10-12 00:59:26,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:59:26,961 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:26,961 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:26,961 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:26,961 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:26,962 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:59:26,962 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:26,962 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:26,962 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:26,962 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration5_Loop [2024-10-12 00:59:26,962 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:26,962 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:26,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:26,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:26,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:26,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:26,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:27,010 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:27,010 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:59:27,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,012 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:59:27,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:27,016 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:27,029 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:27,030 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret4=0} Honda state: {fibonacci_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:27,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:59:27,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,047 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:59:27,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:27,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:27,065 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:27,065 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:27,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:27,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,082 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:59:27,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:27,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:27,097 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:59:27,098 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:59:27,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:59:27,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,114 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:59:27,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:27,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:27,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:59:27,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,150 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:59:27,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:59:27,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:27,187 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:59:27,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:59:27,192 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:27,192 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:27,192 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:27,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:27,192 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:59:27,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:27,193 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:27,193 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration5_Loop [2024-10-12 00:59:27,193 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:27,193 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:27,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:27,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:27,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:27,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:27,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:27,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:27,235 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:59:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,240 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:59:27,244 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-12 00:59:27,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:27,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:27,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:27,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:27,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:27,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:27,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:27,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:27,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:59:27,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,279 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:59:27,281 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-12 00:59:27,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:27,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:27,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:27,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:27,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:27,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:27,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:27,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:27,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:59:27,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,313 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:59:27,317 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-12 00:59:27,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:27,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:27,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:27,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:27,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:27,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:27,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:27,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:27,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:27,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,349 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:59:27,352 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-12 00:59:27,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:27,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:27,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:27,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:27,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:27,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:27,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:27,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:59:27,368 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:59:27,368 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:59:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:27,370 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:27,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:59:27,371 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:59:27,371 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:59:27,371 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:59:27,371 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2024-10-12 00:59:27,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:27,382 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:59:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:27,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:27,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:59:27,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:27,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:27,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:27,951 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-12 00:59:27,952 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-12 00:59:27,953 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:28,011 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 287 states and 420 transitions. Complement of second has 17 states. [2024-10-12 00:59:28,012 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-12 00:59:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-12 00:59:28,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 71 letters. Loop has 4 letters. [2024-10-12 00:59:28,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:28,013 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:59:28,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:28,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:59:28,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:28,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:28,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:28,555 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-12 00:59:28,556 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-12 00:59:28,556 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:28,606 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 287 states and 420 transitions. Complement of second has 17 states. [2024-10-12 00:59:28,607 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-12 00:59:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-12 00:59:28,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 71 letters. Loop has 4 letters. [2024-10-12 00:59:28,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:28,608 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:59:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:28,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:59:28,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:29,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:29,134 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-12 00:59:29,135 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-12 00:59:29,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:29,209 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 394 transitions. cyclomatic complexity: 133. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 340 states and 477 transitions. Complement of second has 19 states. [2024-10-12 00:59:29,210 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-12 00:59:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-10-12 00:59:29,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 71 letters. Loop has 4 letters. [2024-10-12 00:59:29,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:29,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 75 letters. Loop has 4 letters. [2024-10-12 00:59:29,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:29,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 71 letters. Loop has 8 letters. [2024-10-12 00:59:29,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:29,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 477 transitions. [2024-10-12 00:59:29,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:29,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 279 states and 410 transitions. [2024-10-12 00:59:29,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2024-10-12 00:59:29,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-10-12 00:59:29,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 410 transitions. [2024-10-12 00:59:29,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:29,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 410 transitions. [2024-10-12 00:59:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 410 transitions. [2024-10-12 00:59:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2024-10-12 00:59:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.1301775147928994) internal successors, (191), 171 states have internal predecessors, (191), 61 states have call successors, (73), 36 states have call predecessors, (73), 41 states have return successors, (138), 63 states have call predecessors, (138), 59 states have call successors, (138) [2024-10-12 00:59:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 402 transitions. [2024-10-12 00:59:29,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 402 transitions. [2024-10-12 00:59:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:59:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 00:59:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-10-12 00:59:29,236 INFO L87 Difference]: Start difference. First operand 271 states and 402 transitions. Second operand has 20 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 16 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-12 00:59:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:59:29,393 INFO L93 Difference]: Finished difference Result 483 states and 750 transitions. [2024-10-12 00:59:29,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 750 transitions. [2024-10-12 00:59:29,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:29,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 478 states and 743 transitions. [2024-10-12 00:59:29,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2024-10-12 00:59:29,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2024-10-12 00:59:29,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 478 states and 743 transitions. [2024-10-12 00:59:29,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:29,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 478 states and 743 transitions. [2024-10-12 00:59:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states and 743 transitions. [2024-10-12 00:59:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 362. [2024-10-12 00:59:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 225 states have internal predecessors, (259), 83 states have call successors, (99), 48 states have call predecessors, (99), 54 states have return successors, (218), 88 states have call predecessors, (218), 81 states have call successors, (218) [2024-10-12 00:59:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 576 transitions. [2024-10-12 00:59:29,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-12 00:59:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:59:29,441 INFO L425 stractBuchiCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-12 00:59:29,442 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:59:29,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 576 transitions. [2024-10-12 00:59:29,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:29,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:59:29,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:59:29,448 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 16, 15, 11, 10, 8, 8, 7, 7, 5, 3, 1, 1, 1] [2024-10-12 00:59:29,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:59:29,450 INFO L745 eck$LassoCheckResult]: Stem: 6250#$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(14, 2);call #Ultimate.allocInit(12, 3); 6251#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; 6252#L29 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 6253#$Ultimate##0 ~n := #in~n; 6315#L17 assume !(~n < 1); 6313#L19 assume !(1 == ~n); 6288#L22 call #t~ret4 := fibonacci(~n - 1);< 6311#$Ultimate##0 ~n := #in~n; 6309#L17 assume !(~n < 1); 6307#L19 assume !(1 == ~n); 6221#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6310#L17 assume !(~n < 1); 6308#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6310#L17 assume !(~n < 1); 6308#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6310#L17 assume !(~n < 1); 6308#L19 assume !(1 == ~n); 6222#L22 call #t~ret4 := fibonacci(~n - 1);< 6292#$Ultimate##0 ~n := #in~n; 6312#L17 assume !(~n < 1); 6260#L19 assume 1 == ~n;#res := 1; 6261#fibonacciFINAL assume true; 6555#fibonacciEXIT >#31#return; 6220#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6223#$Ultimate##0 ~n := #in~n; 6579#L17 assume ~n < 1;#res := 0; 6578#fibonacciFINAL assume true; 6576#fibonacciEXIT >#33#return; 6575#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6572#fibonacciFINAL assume true; 6569#fibonacciEXIT >#31#return; 6238#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6361#$Ultimate##0 ~n := #in~n; 6381#L17 assume !(~n < 1); 6367#L19 assume 1 == ~n;#res := 1; 6273#fibonacciFINAL assume true; 6359#fibonacciEXIT >#33#return; 6355#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6350#fibonacciFINAL assume true; 6306#fibonacciEXIT >#31#return; 6241#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6302#$Ultimate##0 ~n := #in~n; 6393#L17 assume !(~n < 1); 6394#L19 assume !(1 == ~n); 6327#L22 call #t~ret4 := fibonacci(~n - 1);< 6348#$Ultimate##0 ~n := #in~n; 6466#L17 assume !(~n < 1); 6349#L19 assume 1 == ~n;#res := 1; 6347#fibonacciFINAL assume true; 6325#fibonacciEXIT >#31#return; 6319#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6324#$Ultimate##0 ~n := #in~n; 6377#L17 assume ~n < 1;#res := 0; 6376#fibonacciFINAL assume true; 6316#fibonacciEXIT >#33#return; 6314#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6304#fibonacciFINAL assume true; 6300#fibonacciEXIT >#33#return; 6296#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6294#fibonacciFINAL assume true; 6290#fibonacciEXIT >#31#return; 6240#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6278#$Ultimate##0 ~n := #in~n; 6279#L17 assume !(~n < 1); 6286#L19 assume !(1 == ~n); 6274#L22 call #t~ret4 := fibonacci(~n - 1);< 6431#$Ultimate##0 ~n := #in~n; 6432#L17 assume !(~n < 1); 6428#L19 assume !(1 == ~n); 6410#L22 call #t~ret4 := fibonacci(~n - 1);< 6415#$Ultimate##0 ~n := #in~n; 6397#L17 assume !(~n < 1); 6416#L19 assume 1 == ~n;#res := 1; 6413#fibonacciFINAL assume true; 6409#fibonacciEXIT >#31#return; 6401#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6407#$Ultimate##0 ~n := #in~n; 6412#L17 assume ~n < 1;#res := 0; 6408#fibonacciFINAL assume true; 6399#fibonacciEXIT >#33#return; 6405#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6574#fibonacciFINAL assume true; 6571#fibonacciEXIT >#31#return; 6360#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6361#$Ultimate##0 ~n := #in~n; 6381#L17 assume !(~n < 1); 6367#L19 assume 1 == ~n;#res := 1; 6273#fibonacciFINAL assume true; 6359#fibonacciEXIT >#33#return; 6355#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6350#fibonacciFINAL assume true; 6306#fibonacciEXIT >#33#return; 6291#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 6435#fibonacciFINAL assume true; 6297#fibonacciEXIT >#31#return; 6280#L22-1 call #t~ret5 := fibonacci(~n - 2);< 6281#$Ultimate##0 ~n := #in~n; 6287#L17 assume !(~n < 1); 6478#L19 assume !(1 == ~n); 6234#L22 call #t~ret4 := fibonacci(~n - 1);< 6490#$Ultimate##0 ~n := #in~n; 6491#L17 assume !(~n < 1); 6567#L19 assume !(1 == ~n); 6233#L22 call #t~ret4 := fibonacci(~n - 1);< 6236#$Ultimate##0 ~n := #in~n; 6265#L17 assume !(~n < 1); 6512#L19 assume !(1 == ~n); 6264#L22 [2024-10-12 00:59:29,451 INFO L747 eck$LassoCheckResult]: Loop: 6264#L22 call #t~ret4 := fibonacci(~n - 1);< 6236#$Ultimate##0 ~n := #in~n; 6265#L17 assume !(~n < 1); 6512#L19 assume !(1 == ~n); 6264#L22 [2024-10-12 00:59:29,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash -315610179, now seen corresponding path program 6 times [2024-10-12 00:59:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:29,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415624872] [2024-10-12 00:59:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:29,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:29,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1817383, now seen corresponding path program 3 times [2024-10-12 00:59:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389962324] [2024-10-12 00:59:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:29,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:59:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:59:29,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:59:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1033349347, now seen corresponding path program 7 times [2024-10-12 00:59:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:59:29,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753008006] [2024-10-12 00:59:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:59:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:59:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 00:59:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 00:59:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 00:59:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 00:59:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 00:59:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 00:59:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 00:59:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 231 proven. 268 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-10-12 00:59:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:59:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753008006] [2024-10-12 00:59:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753008006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:59:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519292796] [2024-10-12 00:59:30,034 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 00:59:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:59:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:30,035 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:59:30,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-10-12 00:59:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:30,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 00:59:30,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 231 proven. 268 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-10-12 00:59:30,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:59:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 231 proven. 294 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-12 00:59:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519292796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:59:30,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:59:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 17] total 23 [2024-10-12 00:59:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644615224] [2024-10-12 00:59:30,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:59:30,974 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:30,975 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:30,975 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:30,975 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:30,975 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:59:30,975 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:30,975 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:30,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:30,975 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration6_Loop [2024-10-12 00:59:30,975 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:30,975 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:30,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:30,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:30,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:30,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:31,020 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:31,020 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:59:31,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:31,022 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:31,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:59:31,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:59:31,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:31,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:59:31,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:31,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:31,066 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:31,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:59:31,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:59:31,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:59:32,265 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:59:32,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:32,272 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:59:32,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:59:32,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:59:32,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:59:32,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:59:32,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:32,273 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:59:32,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:59:32,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: Fibonacci05.c_Iteration6_Loop [2024-10-12 00:59:32,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:59:32,273 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:59:32,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:32,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:32,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:32,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:59:32,308 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:59:32,308 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:59:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:32,310 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:32,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:59:32,313 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-12 00:59:32,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:32,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:32,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:32,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:32,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:32,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:32,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:32,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:32,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:32,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:32,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:32,336 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:32,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:59:32,338 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-12 00:59:32,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:32,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:32,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:32,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:32,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:32,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:32,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:32,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:59:32,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:59:32,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:32,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:32,369 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:32,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:59:32,372 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-12 00:59:32,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:59:32,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:59:32,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:59:32,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:59:32,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:59:32,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:59:32,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:59:32,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:59:32,394 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:59:32,394 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:59:32,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:59:32,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:59:32,396 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:59:32,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:59:32,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:59:32,397 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:59:32,397 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:59:32,398 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2024-10-12 00:59:32,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:32,409 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:59:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:32,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 00:59:32,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:32,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-12 00:59:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:33,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:33,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:33,221 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-12 00:59:33,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-12 00:59:33,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:33,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 369 states and 584 transitions. Complement of second has 18 states. [2024-10-12 00:59:33,273 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-12 00:59:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-12 00:59:33,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 112 letters. Loop has 4 letters. [2024-10-12 00:59:33,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:33,274 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:59:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:33,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 00:59:33,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:33,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:33,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:33,998 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-12 00:59:33,999 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-12 00:59:33,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:34,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 377 states and 592 transitions. Complement of second has 17 states. [2024-10-12 00:59:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-12 00:59:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2024-10-12 00:59:34,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 112 letters. Loop has 4 letters. [2024-10-12 00:59:34,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:34,067 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:59:34,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:59:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:34,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 00:59:34,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:59:34,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:59:34,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:59:34,780 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-12 00:59:34,781 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 4 loop predicates [2024-10-12 00:59:34,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:34,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 362 states and 576 transitions. cyclomatic complexity: 218. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 425 states and 667 transitions. Complement of second has 21 states. [2024-10-12 00:59:34,833 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-12 00:59:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 00:59:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2024-10-12 00:59:34,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 112 letters. Loop has 4 letters. [2024-10-12 00:59:34,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:34,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 116 letters. Loop has 4 letters. [2024-10-12 00:59:34,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:34,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 112 letters. Loop has 8 letters. [2024-10-12 00:59:34,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:59:34,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 425 states and 667 transitions. [2024-10-12 00:59:34,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-12 00:59:34,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 425 states to 362 states and 576 transitions. [2024-10-12 00:59:34,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2024-10-12 00:59:34,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2024-10-12 00:59:34,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 576 transitions. [2024-10-12 00:59:34,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:59:34,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-12 00:59:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 576 transitions. [2024-10-12 00:59:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-10-12 00:59:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 225 states have internal predecessors, (259), 83 states have call successors, (99), 48 states have call predecessors, (99), 54 states have return successors, (218), 88 states have call predecessors, (218), 81 states have call successors, (218) [2024-10-12 00:59:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 576 transitions. [2024-10-12 00:59:34,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 362 states and 576 transitions. [2024-10-12 00:59:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:59:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 00:59:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-10-12 00:59:34,859 INFO L87 Difference]: Start difference. First operand 362 states and 576 transitions. Second operand has 24 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 19 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (23), 10 states have call predecessors, (23), 15 states have call successors, (23) [2024-10-12 00:59:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:59:35,059 INFO L93 Difference]: Finished difference Result 542 states and 862 transitions. [2024-10-12 00:59:35,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 542 states and 862 transitions. [2024-10-12 00:59:35,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:59:35,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 542 states to 0 states and 0 transitions. [2024-10-12 00:59:35,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:59:35,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:59:35,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:59:35,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:59:35,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:59:35,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:59:35,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:59:35,067 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:59:35,067 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:59:35,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:59:35,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:59:35,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:59:35,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:59:35 BoogieIcfgContainer [2024-10-12 00:59:35,075 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:59:35,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:59:35,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:59:35,076 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:59:35,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:59:19" (3/4) ... [2024-10-12 00:59:35,078 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:59:35,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:59:35,079 INFO L158 Benchmark]: Toolchain (without parser) took 16382.35ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 114.5MB in the beginning and 56.0MB in the end (delta: 58.5MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-10-12 00:59:35,080 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:59:35,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.43ms. Allocated memory is still 165.7MB. Free memory was 114.0MB in the beginning and 102.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:59:35,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 165.7MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:59:35,080 INFO L158 Benchmark]: Boogie Preprocessor took 42.81ms. Allocated memory is still 165.7MB. Free memory was 100.9MB in the beginning and 99.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:59:35,081 INFO L158 Benchmark]: RCFGBuilder took 307.65ms. Allocated memory is still 165.7MB. Free memory was 99.3MB in the beginning and 134.2MB in the end (delta: -34.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:59:35,081 INFO L158 Benchmark]: BuchiAutomizer took 15773.43ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 133.2MB in the beginning and 57.0MB in the end (delta: 76.2MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2024-10-12 00:59:35,081 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 199.2MB. Free memory was 57.0MB in the beginning and 56.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:59:35,082 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.43ms. Allocated memory is still 165.7MB. Free memory was 114.0MB in the beginning and 102.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 165.7MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.81ms. Allocated memory is still 165.7MB. Free memory was 100.9MB in the beginning and 99.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 307.65ms. Allocated memory is still 165.7MB. Free memory was 99.3MB in the beginning and 134.2MB in the end (delta: -34.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 15773.43ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 133.2MB in the beginning and 57.0MB in the end (delta: 76.2MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 199.2MB. Free memory was 57.0MB in the beginning and 56.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 5 locations. One deterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function \old(n) and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 7 iterations. TraceHistogramMax:19. Analysis of lassos took 7.9s. Construction of modules took 0.8s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 260 StatesRemovedByMinimization, 7 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: 16/46 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 477 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 869 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 191 mSDtfsCounter, 869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT4 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp82 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf92 smp80 dnf100 smp100 tf112 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:59:35,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-10-12 00:59:35,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-10-12 00:59:35,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-12 00:59:35,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-12 00:59:35,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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