./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/gcd_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:14:25,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:14:25,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:14:25,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:14:25,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:14:25,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:14:25,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:14:25,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:14:25,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:14:25,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:14:25,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:14:25,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:14:25,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:14:25,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:14:25,941 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:14:25,941 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:14:25,941 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:14:25,941 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:14:25,942 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:14:25,952 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:14:25,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:14:25,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:14:25,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:14:25,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:14:25,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:14:25,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:14:25,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:14:25,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:14:25,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:14:25,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:14:25,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:14:25,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:14:25,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:14:25,957 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:14:25,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:14:25,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:14:25,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:14:25,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:14:25,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:14:25,959 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:14:25,960 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef [2024-11-17 08:14:26,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:14:26,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:14:26,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:14:26,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:14:26,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:14:26,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2024-11-17 08:14:27,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:14:27,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:14:27,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2024-11-17 08:14:28,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f77bcf4/ea89eb0822d74142a3198e73625c8a82/FLAG4f468e6fa [2024-11-17 08:14:28,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10f77bcf4/ea89eb0822d74142a3198e73625c8a82 [2024-11-17 08:14:28,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:14:28,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:14:28,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:14:28,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:14:28,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:14:28,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e50daf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28, skipping insertion in model container [2024-11-17 08:14:28,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:14:28,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:14:28,252 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:14:28,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:14:28,289 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:14:28,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28 WrapperNode [2024-11-17 08:14:28,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:14:28,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:14:28,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:14:28,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:14:28,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,328 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 68 [2024-11-17 08:14:28,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:14:28,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:14:28,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:14:28,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:14:28,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,357 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-17 08:14:28,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:14:28,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:14:28,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:14:28,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:14:28,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (1/1) ... [2024-11-17 08:14:28,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:28,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:28,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:14:28,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:14:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:14:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:14:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:14:28,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:14:28,532 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:14:28,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:14:28,752 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-17 08:14:28,752 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:14:28,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:14:28,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:14:28,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:14:28 BoogieIcfgContainer [2024-11-17 08:14:28,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:14:28,767 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:14:28,767 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:14:28,776 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:14:28,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:14:28,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:14:28" (1/3) ... [2024-11-17 08:14:28,778 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59530b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:14:28, skipping insertion in model container [2024-11-17 08:14:28,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:14:28,778 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:14:28" (2/3) ... [2024-11-17 08:14:28,779 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59530b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:14:28, skipping insertion in model container [2024-11-17 08:14:28,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:14:28,780 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:14:28" (3/3) ... [2024-11-17 08:14:28,781 INFO L332 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2024-11-17 08:14:28,842 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:14:28,842 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:14:28,842 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:14:28,843 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:14:28,843 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:14:28,844 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:14:28,844 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:14:28,844 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:14:28,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:28,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:28,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:28,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:28,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:14:28,878 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:28,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:14:28,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:28,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:28,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:28,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:28,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:14:28,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:28,888 INFO L745 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 24#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 6#L22true assume !(gcd_test_~a#1 < 0); 8#L23true assume !(gcd_test_~b#1 < 0); 16#L25true assume !(0 == gcd_test_~a#1); 18#L29true [2024-11-17 08:14:28,888 INFO L747 eck$LassoCheckResult]: Loop: 18#L29true assume true; 19#L29-1true assume !!(0 != gcd_test_~b#1); 3#L30true assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 18#L29true [2024-11-17 08:14:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 63906593, now seen corresponding path program 1 times [2024-11-17 08:14:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:28,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884729539] [2024-11-17 08:14:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:28,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:29,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash 56567, now seen corresponding path program 1 times [2024-11-17 08:14:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:29,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507930276] [2024-11-17 08:14:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:29,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:29,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:29,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1170826711, now seen corresponding path program 1 times [2024-11-17 08:14:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:29,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244096543] [2024-11-17 08:14:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:29,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:29,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:29,139 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:14:29,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:14:29,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:14:29,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:14:29,140 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:14:29,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:29,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:14:29,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:14:29,141 INFO L132 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration1_Loop [2024-11-17 08:14:29,141 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:14:29,141 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:14:29,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,217 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:14:29,218 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:14:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:29,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:29,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:14:29,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:14:29,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:14:29,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:14:29,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:29,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:29,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:14:29,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:14:29,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:14:29,365 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:14:29,365 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_test_~b#1=-5, ULTIMATE.start_gcd_test_~a#1=-4} Honda state: {ULTIMATE.start_gcd_test_~b#1=-5, ULTIMATE.start_gcd_test_~a#1=-4} Generalized eigenvectors: [{ULTIMATE.start_gcd_test_~b#1=0, ULTIMATE.start_gcd_test_~a#1=0}, {ULTIMATE.start_gcd_test_~b#1=0, ULTIMATE.start_gcd_test_~a#1=0}, {ULTIMATE.start_gcd_test_~b#1=0, ULTIMATE.start_gcd_test_~a#1=5}] Lambdas: [0, 9, 1] Nus: [0, 0] [2024-11-17 08:14:29,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-17 08:14:29,822 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:14:29,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:14:29,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:14:29,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:14:29,823 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:14:29,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:29,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:14:29,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:14:29,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration1_Lasso [2024-11-17 08:14:29,824 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:14:29,824 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:14:29,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:29,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:30,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:30,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:30,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:30,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:30,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:30,298 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:14:30,303 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:14:30,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:14:30,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:30,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:30,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:30,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:30,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:14:30,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:14:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:14:30,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:14:30,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:14:30,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:14:30,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,469 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:14:30,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:30,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:30,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:30,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:14:30,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:14:30,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:14:30,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:14:30,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:14:30,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:14:30,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:14:30,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:14:30,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:14:30,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,654 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:14:30,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:14:30,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,695 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:14:30,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:14:30,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,735 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:14:30,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:14:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,771 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:14:30,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:30,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:30,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:30,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:30,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,810 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:14:30,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:30,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:30,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:30,827 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:14:30,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:30,841 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:14:30,841 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:14:30,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:14:30,917 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-17 08:14:30,917 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-17 08:14:30,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:30,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:30,945 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:30,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:14:30,948 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:14:30,963 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-17 08:14:30,964 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:14:30,964 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~a#1) = 1*ULTIMATE.start_gcd_test_~a#1 Supporting invariants [1*ULTIMATE.start_gcd_test_~b#1 >= 0] [2024-11-17 08:14:30,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:30,986 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-11-17 08:14:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:31,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:14:31,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:31,067 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:14:31,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:31,141 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-17 08:14:31,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,215 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 89 transitions. Complement of second has 9 states. [2024-11-17 08:14:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:14:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2024-11-17 08:14:31,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-17 08:14:31,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:31,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 8 letters. Loop has 3 letters. [2024-11-17 08:14:31,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:31,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 5 letters. Loop has 6 letters. [2024-11-17 08:14:31,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:31,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2024-11-17 08:14:31,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:31,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 14 states and 18 transitions. [2024-11-17 08:14:31,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:14:31,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-17 08:14:31,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2024-11-17 08:14:31,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:31,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-17 08:14:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2024-11-17 08:14:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-17 08:14:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-11-17 08:14:31,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-17 08:14:31,264 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-17 08:14:31,265 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:14:31,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-11-17 08:14:31,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:31,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:31,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:31,266 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:14:31,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:31,266 INFO L745 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 162#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 159#L22 assume !(gcd_test_~a#1 < 0); 160#L23 assume !(gcd_test_~b#1 < 0); 168#L25 assume !(0 == gcd_test_~a#1); 169#L29 assume true; 170#L29-1 [2024-11-17 08:14:31,267 INFO L747 eck$LassoCheckResult]: Loop: 170#L29-1 assume !!(0 != gcd_test_~b#1); 163#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 164#L29 assume true; 170#L29-1 [2024-11-17 08:14:31,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1981104410, now seen corresponding path program 1 times [2024-11-17 08:14:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130765648] [2024-11-17 08:14:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 55548, now seen corresponding path program 1 times [2024-11-17 08:14:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194153655] [2024-11-17 08:14:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1935889731, now seen corresponding path program 1 times [2024-11-17 08:14:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863284479] [2024-11-17 08:14:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:31,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863284479] [2024-11-17 08:14:31,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863284479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:14:31,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:14:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:14:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304590430] [2024-11-17 08:14:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:14:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:14:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:14:31,501 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:31,518 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-11-17 08:14:31,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-11-17 08:14:31,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:31,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2024-11-17 08:14:31,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:14:31,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:14:31,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-11-17 08:14:31,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:31,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-17 08:14:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-11-17 08:14:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 08:14:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-17 08:14:31,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-17 08:14:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:14:31,523 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-17 08:14:31,523 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:14:31,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2024-11-17 08:14:31,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:31,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:31,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:31,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:14:31,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:31,524 INFO L745 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 204#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 197#L22 assume !(gcd_test_~a#1 < 0); 198#L23 assume !(gcd_test_~b#1 < 0); 205#L25 assume !(0 == gcd_test_~a#1); 206#L29 assume true; 210#L29-1 assume !!(0 != gcd_test_~b#1); 201#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 202#L29 assume true; 207#L29-1 [2024-11-17 08:14:31,524 INFO L747 eck$LassoCheckResult]: Loop: 207#L29-1 assume !!(0 != gcd_test_~b#1); 199#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 200#L29 assume true; 207#L29-1 [2024-11-17 08:14:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1935889700, now seen corresponding path program 2 times [2024-11-17 08:14:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263810583] [2024-11-17 08:14:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:31,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 55548, now seen corresponding path program 2 times [2024-11-17 08:14:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267106980] [2024-11-17 08:14:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -730772231, now seen corresponding path program 1 times [2024-11-17 08:14:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563527868] [2024-11-17 08:14:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:31,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563527868] [2024-11-17 08:14:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563527868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:14:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106526391] [2024-11-17 08:14:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:14:31,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:31,667 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:14:31,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-17 08:14:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:31,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:14:31,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:31,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:14:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106526391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:14:31,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:14:31,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-17 08:14:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037625067] [2024-11-17 08:14:31,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:14:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 08:14:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:14:31,857 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:31,882 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-17 08:14:31,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2024-11-17 08:14:31,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:31,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 23 transitions. [2024-11-17 08:14:31,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:14:31,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:14:31,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2024-11-17 08:14:31,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:31,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-17 08:14:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2024-11-17 08:14:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 08:14:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-17 08:14:31,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-17 08:14:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:14:31,887 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-17 08:14:31,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:14:31,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2024-11-17 08:14:31,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:31,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:31,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:31,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-17 08:14:31,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:31,889 INFO L745 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 319#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 316#L22 assume !(gcd_test_~a#1 < 0); 317#L23 assume !(gcd_test_~b#1 < 0); 324#L25 assume !(0 == gcd_test_~a#1); 325#L29 assume true; 326#L29-1 assume !!(0 != gcd_test_~b#1); 330#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 327#L29 assume true; 328#L29-1 assume !!(0 != gcd_test_~b#1); 322#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 323#L29 assume true; 336#L29-1 assume !!(0 != gcd_test_~b#1); 333#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 331#L29 assume true; 329#L29-1 [2024-11-17 08:14:31,889 INFO L747 eck$LassoCheckResult]: Loop: 329#L29-1 assume !!(0 != gcd_test_~b#1); 320#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 321#L29 assume true; 329#L29-1 [2024-11-17 08:14:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 752791908, now seen corresponding path program 3 times [2024-11-17 08:14:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239801351] [2024-11-17 08:14:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:31,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 55548, now seen corresponding path program 3 times [2024-11-17 08:14:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608548917] [2024-11-17 08:14:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:31,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1895462727, now seen corresponding path program 2 times [2024-11-17 08:14:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580896709] [2024-11-17 08:14:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:31,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:32,294 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:14:32,295 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:14:32,295 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:14:32,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:14:32,295 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:14:32,295 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:14:32,295 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:14:32,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2024-11-17 08:14:32,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:14:32,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:14:32,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:14:32,655 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:14:32,655 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:14:32,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:32,658 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:32,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:14:32,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:32,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:32,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:32,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:32,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:32,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:32,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:32,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:32,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:14:32,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:32,696 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:32,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:14:32,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:32,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:32,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:32,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:32,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:32,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:14:32,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:14:32,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:32,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-17 08:14:32,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:32,737 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:32,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:14:32,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:32,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:32,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:32,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:32,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:32,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:32,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:32,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:32,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:32,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:32,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:32,771 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:32,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:14:32,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:32,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:32,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:14:32,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:32,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:14:32,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:32,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:14:32,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:14:32,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:14:32,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:14:32,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:32,807 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:32,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:14:32,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:14:32,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:14:32,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:14:32,823 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:14:32,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:14:32,829 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:14:32,829 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:14:32,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:14:32,886 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-17 08:14:32,886 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-17 08:14:32,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:14:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:32,888 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:14:32,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:14:32,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:14:32,901 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-11-17 08:14:32,901 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:14:32,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b#1) = 1*ULTIMATE.start_gcd_test_~b#1 Supporting invariants [1*ULTIMATE.start_gcd_test_~a#1 - 2 >= 0] [2024-11-17 08:14:32,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:32,920 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-11-17 08:14:32,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:32,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:14:32,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:33,125 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:14:33,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:33,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:14:33,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 24 transitions. Complement of second has 6 states. [2024-11-17 08:14:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:14:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-17 08:14:33,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-17 08:14:33,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:33,222 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:14:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:33,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:14:33,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:33,387 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:14:33,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:33,416 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:14:33,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,468 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 24 transitions. Complement of second has 6 states. [2024-11-17 08:14:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:14:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-11-17 08:14:33,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-17 08:14:33,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:33,470 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:14:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:33,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:14:33,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:33,625 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:14:33,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:33,660 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-17 08:14:33,660 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-17 08:14:33,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 4. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 43 transitions. Complement of second has 20 states. [2024-11-17 08:14:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-17 08:14:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2024-11-17 08:14:33,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 3 letters. [2024-11-17 08:14:33,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:33,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 18 letters. Loop has 3 letters. [2024-11-17 08:14:33,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:33,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 6 letters. [2024-11-17 08:14:33,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:14:33,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2024-11-17 08:14:33,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:33,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 32 transitions. [2024-11-17 08:14:33,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-17 08:14:33,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:14:33,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2024-11-17 08:14:33,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:33,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:14:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2024-11-17 08:14:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-17 08:14:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-17 08:14:33,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:14:33,842 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:14:33,842 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:14:33,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-11-17 08:14:33,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:33,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:33,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:33,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1] [2024-11-17 08:14:33,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:33,846 INFO L745 eck$LassoCheckResult]: Stem: 676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 677#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 670#L22 assume !(gcd_test_~a#1 < 0); 671#L23 assume !(gcd_test_~b#1 < 0); 678#L25 assume !(0 == gcd_test_~a#1); 679#L29 assume true; 680#L29-1 assume !!(0 != gcd_test_~b#1); 695#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 681#L29 assume true; 682#L29-1 assume !!(0 != gcd_test_~b#1); 696#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 694#L29 assume true; 693#L29-1 assume !!(0 != gcd_test_~b#1); 692#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 691#L29 assume true; 690#L29-1 assume !!(0 != gcd_test_~b#1); 687#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 685#L29 assume true; 683#L29-1 [2024-11-17 08:14:33,846 INFO L747 eck$LassoCheckResult]: Loop: 683#L29-1 assume !!(0 != gcd_test_~b#1); 672#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 673#L29 assume true; 683#L29-1 [2024-11-17 08:14:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1895462758, now seen corresponding path program 4 times [2024-11-17 08:14:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918118325] [2024-11-17 08:14:33,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918118325] [2024-11-17 08:14:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918118325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:14:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:14:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 08:14:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776901787] [2024-11-17 08:14:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:14:33,984 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:14:33,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash 55548, now seen corresponding path program 4 times [2024-11-17 08:14:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:33,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597261199] [2024-11-17 08:14:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:33,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:33,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:34,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 08:14:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-17 08:14:34,014 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:34,046 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-17 08:14:34,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2024-11-17 08:14:34,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:34,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 32 transitions. [2024-11-17 08:14:34,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:14:34,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:14:34,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-11-17 08:14:34,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:34,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-17 08:14:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-11-17 08:14:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-17 08:14:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-17 08:14:34,053 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-17 08:14:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:14:34,054 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-17 08:14:34,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:14:34,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2024-11-17 08:14:34,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:34,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:34,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:34,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 08:14:34,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:34,058 INFO L745 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 740#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 737#L22 assume !(gcd_test_~a#1 < 0); 738#L23 assume !(gcd_test_~b#1 < 0); 745#L25 assume !(0 == gcd_test_~a#1); 746#L29 assume true; 747#L29-1 assume !!(0 != gcd_test_~b#1); 763#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 748#L29 assume true; 749#L29-1 assume !!(0 != gcd_test_~b#1); 743#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 744#L29 assume true; 762#L29-1 assume !!(0 != gcd_test_~b#1); 761#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 760#L29 assume true; 759#L29-1 assume !!(0 != gcd_test_~b#1); 756#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 757#L29 assume true; 758#L29-1 assume !!(0 != gcd_test_~b#1); 753#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 751#L29 assume true; 750#L29-1 [2024-11-17 08:14:34,058 INFO L747 eck$LassoCheckResult]: Loop: 750#L29-1 assume !!(0 != gcd_test_~b#1); 741#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 742#L29 assume true; 750#L29-1 [2024-11-17 08:14:34,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:34,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1795033819, now seen corresponding path program 3 times [2024-11-17 08:14:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:34,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171327431] [2024-11-17 08:14:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:34,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:34,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171327431] [2024-11-17 08:14:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171327431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:14:34,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929343887] [2024-11-17 08:14:34,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:14:34,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:14:34,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:34,181 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:14:34,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-17 08:14:34,223 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 08:14:34,224 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:14:34,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:14:34,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:34,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:14:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929343887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:14:34,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:14:34,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-17 08:14:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498286169] [2024-11-17 08:14:34,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:14:34,432 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:14:34,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 55548, now seen corresponding path program 5 times [2024-11-17 08:14:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714664343] [2024-11-17 08:14:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:34,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:34,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 08:14:34,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-17 08:14:34,456 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:34,529 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-17 08:14:34,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2024-11-17 08:14:34,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:34,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 35 transitions. [2024-11-17 08:14:34,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:14:34,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-17 08:14:34,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2024-11-17 08:14:34,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:14:34,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-17 08:14:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2024-11-17 08:14:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-17 08:14:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-17 08:14:34,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-17 08:14:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:14:34,538 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-17 08:14:34,538 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:14:34,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 33 transitions. [2024-11-17 08:14:34,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:14:34,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:14:34,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:14:34,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 4, 2, 1, 1, 1, 1, 1] [2024-11-17 08:14:34,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:14:34,542 INFO L745 eck$LassoCheckResult]: Stem: 941#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(103, 2, 0, 1);call write~init~int#1(99, 2, 1, 1);call write~init~int#1(100, 2, 2, 1);call write~init~int#1(95, 2, 3, 1);call write~init~int#1(52, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 942#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 939#L22 assume !(gcd_test_~a#1 < 0); 940#L23 assume !(gcd_test_~b#1 < 0); 947#L25 assume !(0 == gcd_test_~a#1); 948#L29 assume true; 949#L29-1 assume !!(0 != gcd_test_~b#1); 968#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 950#L29 assume true; 951#L29-1 assume !!(0 != gcd_test_~b#1); 945#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 946#L29 assume true; 967#L29-1 assume !!(0 != gcd_test_~b#1); 966#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 965#L29 assume true; 964#L29-1 assume !!(0 != gcd_test_~b#1); 963#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 962#L29 assume true; 961#L29-1 assume !!(0 != gcd_test_~b#1); 958#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 959#L29 assume true; 960#L29-1 assume !!(0 != gcd_test_~b#1); 955#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 953#L29 assume true; 952#L29-1 [2024-11-17 08:14:34,542 INFO L747 eck$LassoCheckResult]: Loop: 952#L29-1 assume !!(0 != gcd_test_~b#1); 943#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 944#L29 assume true; 952#L29-1 [2024-11-17 08:14:34,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 786249914, now seen corresponding path program 4 times [2024-11-17 08:14:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518854470] [2024-11-17 08:14:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:14:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:14:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518854470] [2024-11-17 08:14:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518854470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:14:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134196219] [2024-11-17 08:14:34,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:14:34,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:14:34,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:14:34,669 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:14:34,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-17 08:14:34,711 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:14:34,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:14:34,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:14:34,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:14:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:34,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:14:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:14:35,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134196219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:14:35,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:14:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-17 08:14:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288540841] [2024-11-17 08:14:35,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:14:35,024 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:14:35,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:14:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 55548, now seen corresponding path program 6 times [2024-11-17 08:14:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:14:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129391961] [2024-11-17 08:14:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:14:35,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:14:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:35,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:14:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:14:35,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:14:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:14:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 08:14:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-17 08:14:35,056 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. cyclomatic complexity: 6 Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:14:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:14:35,164 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2024-11-17 08:14:35,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 22 transitions. [2024-11-17 08:14:35,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:14:35,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2024-11-17 08:14:35,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:14:35,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:14:35,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:14:35,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:14:35,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:14:35,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:14:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:14:35,166 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:14:35,166 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:14:35,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:14:35,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:14:35,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:14:35,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:14:35 BoogieIcfgContainer [2024-11-17 08:14:35,173 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:14:35,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:14:35,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:14:35,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:14:35,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:14:28" (3/4) ... [2024-11-17 08:14:35,177 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:14:35,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:14:35,179 INFO L158 Benchmark]: Toolchain (without parser) took 7152.31ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 113.6MB in the beginning and 148.0MB in the end (delta: -34.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-11-17 08:14:35,179 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:14:35,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.92ms. Allocated memory is still 148.9MB. Free memory was 113.6MB in the beginning and 101.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:14:35,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.03ms. Allocated memory is still 148.9MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:14:35,179 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 148.9MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:14:35,181 INFO L158 Benchmark]: IcfgBuilder took 399.07ms. Allocated memory is still 148.9MB. Free memory was 98.3MB in the beginning and 116.3MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:14:35,181 INFO L158 Benchmark]: BuchiAutomizer took 6406.23ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 116.3MB in the beginning and 149.1MB in the end (delta: -32.8MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-11-17 08:14:35,181 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 218.1MB. Free memory was 149.1MB in the beginning and 148.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:14:35,183 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.21ms. Allocated memory is still 148.9MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.92ms. Allocated memory is still 148.9MB. Free memory was 113.6MB in the beginning and 101.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.03ms. Allocated memory is still 148.9MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 148.9MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 399.07ms. Allocated memory is still 148.9MB. Free memory was 98.3MB in the beginning and 116.3MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6406.23ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 116.3MB in the beginning and 149.1MB in the end (delta: -32.8MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 218.1MB. Free memory was 149.1MB in the beginning and 148.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 7 terminating modules (5 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function a and consists of 6 locations. One nondeterministic module has affine ranking function b and consists of 8 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 8 iterations. TraceHistogramMax:7. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 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 [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 56 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN3 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp61 ukn63 mio100 lsp87 div100 bol100 ite100 ukn100 eq178 hnf93 smp100 dnf145 smp100 tf101 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 155ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:14:35,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-17 08:14:35,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:35,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:14:35,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE