./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/cggmp2005b.i -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 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:46:30,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:46:30,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:46:30,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:46:30,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:46:30,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:46:30,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:46:30,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:46:30,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:46:30,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:46:30,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:46:30,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:46:30,864 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:46:30,868 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:46:30,868 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:46:30,868 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:46:30,868 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:46:30,868 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:46:30,868 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:46:30,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:46:30,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:46:30,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:46:30,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:46:30,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:46:30,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:46:30,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:46:30,871 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:46:30,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:46:30,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:46:30,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:46:30,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:46:30,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:46:30,872 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:46:30,872 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 -> 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c [2024-11-19 14:46:31,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:46:31,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:46:31,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:46:31,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:46:31,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:46:31,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-11-19 14:46:32,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:46:32,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:46:32,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2024-11-19 14:46:32,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640f0d6ca/c1e40fe67f2a4878b5c413e76d6e3613/FLAGbacf575e4 [2024-11-19 14:46:32,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640f0d6ca/c1e40fe67f2a4878b5c413e76d6e3613 [2024-11-19 14:46:32,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:46:32,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:46:32,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:46:32,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:46:32,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:46:32,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:46:32" (1/1) ... [2024-11-19 14:46:32,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e89929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:32, skipping insertion in model container [2024-11-19 14:46:32,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:46:32" (1/1) ... [2024-11-19 14:46:32,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:46:33,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:46:33,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:46:33,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:46:33,189 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:46:33,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33 WrapperNode [2024-11-19 14:46:33,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:46:33,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:46:33,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:46:33,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:46:33,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,216 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2024-11-19 14:46:33,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:46:33,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:46:33,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:46:33,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:46:33,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,234 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:46:33,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:46:33,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:46:33,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:46:33,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:46:33,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (1/1) ... [2024-11-19 14:46:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:33,280 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-19 14:46:33,282 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-19 14:46:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:46:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:46:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:46:33,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:46:33,377 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:46:33,379 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:46:33,461 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-19 14:46:33,461 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:46:33,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:46:33,472 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:46:33,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:33 BoogieIcfgContainer [2024-11-19 14:46:33,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:46:33,473 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:46:33,473 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:46:33,476 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:46:33,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:33,477 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:46:32" (1/3) ... [2024-11-19 14:46:33,478 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@172f7e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:46:33, skipping insertion in model container [2024-11-19 14:46:33,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:33,478 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:46:33" (2/3) ... [2024-11-19 14:46:33,478 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@172f7e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:46:33, skipping insertion in model container [2024-11-19 14:46:33,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:46:33,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:33" (3/3) ... [2024-11-19 14:46:33,480 INFO L332 chiAutomizerObserver]: Analyzing ICFG cggmp2005b.i [2024-11-19 14:46:33,526 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:46:33,526 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:46:33,526 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:46:33,526 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:46:33,526 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:46:33,526 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:46:33,526 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:46:33,526 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:46:33,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:33,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:46:33,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:33,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:33,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:33,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:46:33,547 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:46:33,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:33,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:46:33,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:33,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:33,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:33,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:46:33,556 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 5#L35-3true [2024-11-19 14:46:33,557 INFO L747 eck$LassoCheckResult]: Loop: 5#L35-3true assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 12#L31-2true assume !(main_~j~0#1 < 20); 6#L31-3true main_~k~0#1 := 4; 11#L35-2true assume !true; 5#L35-3true [2024-11-19 14:46:33,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:46:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094093531] [2024-11-19 14:46:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:33,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:33,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1269299, now seen corresponding path program 1 times [2024-11-19 14:46:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269936808] [2024-11-19 14:46:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:33,720 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-19 14:46:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269936808] [2024-11-19 14:46:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269936808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:46:33,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:46:33,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 14:46:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785901427] [2024-11-19 14:46:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:46:33,726 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:46:33,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:46:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:46:33,758 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:33,763 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-11-19 14:46:33,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-11-19 14:46:33,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:46:33,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 6 states and 8 transitions. [2024-11-19 14:46:33,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:46:33,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:46:33,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8 transitions. [2024-11-19 14:46:33,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:46:33,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-11-19 14:46:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 8 transitions. [2024-11-19 14:46:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-19 14:46:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) 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-19 14:46:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2024-11-19 14:46:33,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-11-19 14:46:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:46:33,793 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-11-19 14:46:33,794 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:46:33,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2024-11-19 14:46:33,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:46:33,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:33,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:33,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:46:33,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:46:33,795 INFO L745 eck$LassoCheckResult]: Stem: 37#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 40#L35-3 [2024-11-19 14:46:33,795 INFO L747 eck$LassoCheckResult]: Loop: 40#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 41#L31-2 assume !(main_~j~0#1 < 20); 42#L31-3 main_~k~0#1 := 4; 39#L35-2 assume !(main_~k~0#1 <= 3); 40#L35-3 [2024-11-19 14:46:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:46:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058795895] [2024-11-19 14:46:33,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:33,803 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:46:33,803 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:33,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:33,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:33,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1269295, now seen corresponding path program 1 times [2024-11-19 14:46:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224725239] [2024-11-19 14:46:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:33,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:33,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:33,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash 889696497, now seen corresponding path program 1 times [2024-11-19 14:46:33,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:33,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067786934] [2024-11-19 14:46:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:33,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:33,895 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-19 14:46:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067786934] [2024-11-19 14:46:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067786934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:46:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:46:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:46:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745555348] [2024-11-19 14:46:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:46:33,959 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:33,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:33,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:33,960 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:33,960 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:33,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:33,960 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:33,960 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:33,960 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Loop [2024-11-19 14:46:33,960 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:33,961 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:33,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:33,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:34,037 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:34,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,041 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-19 14:46:34,042 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-19 14:46:34,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:34,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:34,068 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:46:34,068 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=20} Honda state: {ULTIMATE.start_main_~j~0#1=20} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:46:34,080 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-19 14:46:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,081 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-19 14:46:34,082 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-19 14:46:34,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:34,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:34,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:34,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,107 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-19 14:46:34,108 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-19 14:46:34,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:34,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:34,138 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:34,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:46:34,146 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:34,146 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:34,146 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:34,146 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:34,147 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:34,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:34,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:34,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Loop [2024-11-19 14:46:34,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:34,147 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:34,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,191 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:34,195 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:34,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,198 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-19 14:46:34,199 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-19 14:46:34,200 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-19 14:46:34,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:34,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:34,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:34,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:34,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:34,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:34,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:34,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:46:34,227 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-19 14:46:34,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,229 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-19 14:46:34,230 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-19 14:46:34,231 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-19 14:46:34,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:34,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:34,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:34,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:34,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:34,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:34,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:34,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:34,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:34,248 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,251 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-19 14:46:34,252 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-19 14:46:34,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:34,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:34,253 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:34,253 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 201 Supporting invariants [] [2024-11-19 14:46:34,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:34,268 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:34,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:34,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:34,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:34,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:34,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:34,357 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-19 14:46:34,360 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:46:34,361 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 14:46:34,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 14 states and 21 transitions. Complement of second has 4 states. [2024-11-19 14:46:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 14:46:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-19 14:46:34,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:46:34,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:46:34,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-19 14:46:34,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-11-19 14:46:34,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-19 14:46:34,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 20 transitions. [2024-11-19 14:46:34,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:46:34,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:46:34,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2024-11-19 14:46:34,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:34,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2024-11-19 14:46:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2024-11-19 14:46:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-11-19 14:46:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 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-19 14:46:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2024-11-19 14:46:34,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 17 transitions. [2024-11-19 14:46:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:46:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:46:34,401 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 14:46:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:34,408 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2024-11-19 14:46:34,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 19 transitions. [2024-11-19 14:46:34,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-19 14:46:34,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 19 transitions. [2024-11-19 14:46:34,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:46:34,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:46:34,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2024-11-19 14:46:34,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:34,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2024-11-19 14:46:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2024-11-19 14:46:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-19 14:46:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2024-11-19 14:46:34,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2024-11-19 14:46:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:46:34,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2024-11-19 14:46:34,445 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:46:34,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 19 transitions. [2024-11-19 14:46:34,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-19 14:46:34,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:34,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:34,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:46:34,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-19 14:46:34,446 INFO L745 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 127#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 128#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 123#L31-2 [2024-11-19 14:46:34,446 INFO L747 eck$LassoCheckResult]: Loop: 123#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 123#L31-2 [2024-11-19 14:46:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2024-11-19 14:46:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089427148] [2024-11-19 14:46:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:34,468 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-19 14:46:34,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:34,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:34,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2024-11-19 14:46:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141837817] [2024-11-19 14:46:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:34,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:34,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 28699944, now seen corresponding path program 2 times [2024-11-19 14:46:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094821579] [2024-11-19 14:46:34,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:34,526 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:34,527 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:34,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:34,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:34,669 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:34,669 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:34,669 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:34,669 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:34,670 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:34,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:34,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:34,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Lasso [2024-11-19 14:46:34,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:34,670 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:34,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:34,808 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:34,808 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:34,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,810 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-19 14:46:34,811 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-19 14:46:34,812 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-19 14:46:34,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:34,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:34,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:34,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:34,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:46:34,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:46:34,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:34,839 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:46:34,839 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-19 14:46:34,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:34,841 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-19 14:46:34,843 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-19 14:46:34,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:34,855 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-19 14:46:34,856 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:34,856 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 39*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~i~0#1 - 1 >= 0] [2024-11-19 14:46:34,867 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-19 14:46:34,872 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-11-19 14:46:34,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:34,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:34,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:34,938 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:46:34,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:34,938 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-19 14:46:34,939 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2024-11-19 14:46:34,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 19 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 19 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 39 transitions. Complement of second has 7 states. [2024-11-19 14:46:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2024-11-19 14:46:34,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2024-11-19 14:46:34,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2024-11-19 14:46:34,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:46:34,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:34,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2024-11-19 14:46:34,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2024-11-19 14:46:34,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 31 transitions. [2024-11-19 14:46:34,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:46:34,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-19 14:46:34,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2024-11-19 14:46:34,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:34,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2024-11-19 14:46:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2024-11-19 14:46:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2024-11-19 14:46:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-19 14:46:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2024-11-19 14:46:34,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-11-19 14:46:34,983 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2024-11-19 14:46:34,983 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:46:34,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2024-11-19 14:46:34,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-19 14:46:34,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:34,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:34,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:46:34,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-19 14:46:34,986 INFO L745 eck$LassoCheckResult]: Stem: 207#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 215#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 216#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 212#L31-2 assume !(main_~j~0#1 < 20); 213#L31-3 main_~k~0#1 := 4; 209#L35-2 [2024-11-19 14:46:34,986 INFO L747 eck$LassoCheckResult]: Loop: 209#L35-2 assume !!(main_~k~0#1 <= 3);main_~k~0#1 := 1 + main_~k~0#1; 209#L35-2 [2024-11-19 14:46:34,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 889698226, now seen corresponding path program 1 times [2024-11-19 14:46:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:34,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066143864] [2024-11-19 14:46:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066143864] [2024-11-19 14:46:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066143864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711883036] [2024-11-19 14:46:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:35,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 14:46:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:35,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:46:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711883036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:35,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 14:46:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336104668] [2024-11-19 14:46:35,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:35,156 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2024-11-19 14:46:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003599957] [2024-11-19 14:46:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:35,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:35,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:35,177 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:35,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:35,177 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:35,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:35,177 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:35,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:35,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:35,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2024-11-19 14:46:35,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:35,178 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:35,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,201 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:35,201 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:35,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,203 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-19 14:46:35,204 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-19 14:46:35,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:35,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:35,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:35,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,228 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-19 14:46:35,228 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-19 14:46:35,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:35,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:35,256 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:35,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:35,260 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:35,260 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:35,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:35,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:35,261 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:35,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,261 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:35,261 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:35,261 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration4_Loop [2024-11-19 14:46:35,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:35,261 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:35,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,283 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:35,283 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:35,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,285 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-19 14:46:35,287 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-19 14:46:35,288 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-19 14:46:35,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:35,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:35,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:35,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:35,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:35,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:35,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:35,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:35,302 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:35,302 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,304 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-19 14:46:35,305 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-19 14:46:35,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:35,306 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:35,306 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:35,306 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2024-11-19 14:46:35,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:35,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:35,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,355 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,355 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-19 14:46:35,355 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:46:35,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 23 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-19 14:46:35,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 23 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 34 states and 54 transitions. Complement of second has 5 states. [2024-11-19 14:46:35,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-19 14:46:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-19 14:46:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2024-11-19 14:46:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2024-11-19 14:46:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:46:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:35,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 54 transitions. [2024-11-19 14:46:35,367 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2024-11-19 14:46:35,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 21 states and 34 transitions. [2024-11-19 14:46:35,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:46:35,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:46:35,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 34 transitions. [2024-11-19 14:46:35,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:35,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 34 transitions. [2024-11-19 14:46:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 34 transitions. [2024-11-19 14:46:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 12. [2024-11-19 14:46:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 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-19 14:46:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2024-11-19 14:46:35,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2024-11-19 14:46:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:46:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:46:35,370 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:35,395 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2024-11-19 14:46:35,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2024-11-19 14:46:35,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-19 14:46:35,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 20 transitions. [2024-11-19 14:46:35,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:46:35,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:46:35,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2024-11-19 14:46:35,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:35,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-19 14:46:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2024-11-19 14:46:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-19 14:46:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2024-11-19 14:46:35,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-19 14:46:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:46:35,398 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2024-11-19 14:46:35,398 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:46:35,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2024-11-19 14:46:35,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-19 14:46:35,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:35,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:35,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1, 1, 1] [2024-11-19 14:46:35,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-19 14:46:35,399 INFO L745 eck$LassoCheckResult]: Stem: 359#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 368#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 366#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 367#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 372#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 371#L31-2 assume !(main_~j~0#1 < 20); 369#L31-3 main_~k~0#1 := 4; 362#L35-2 assume !(main_~k~0#1 <= 3); 363#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 370#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 364#L31-2 [2024-11-19 14:46:35,399 INFO L747 eck$LassoCheckResult]: Loop: 364#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 364#L31-2 [2024-11-19 14:46:35,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1309449898, now seen corresponding path program 1 times [2024-11-19 14:46:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640758070] [2024-11-19 14:46:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:46:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 14:46:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640758070] [2024-11-19 14:46:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640758070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:46:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:46:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:46:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707714664] [2024-11-19 14:46:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:46:35,431 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:35,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2024-11-19 14:46:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321725276] [2024-11-19 14:46:35,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:46:35,439 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:35,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:35,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:46:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:46:35,458 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 4.5) 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-19 14:46:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:35,470 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-11-19 14:46:35,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-11-19 14:46:35,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-19 14:46:35,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2024-11-19 14:46:35,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:46:35,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:46:35,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-11-19 14:46:35,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:46:35,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:46:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-11-19 14:46:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 14:46:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:46:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-19 14:46:35,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:46:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:46:35,475 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:46:35,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:46:35,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-19 14:46:35,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-19 14:46:35,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:46:35,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:46:35,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1] [2024-11-19 14:46:35,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-19 14:46:35,476 INFO L745 eck$LassoCheckResult]: Stem: 392#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100; 399#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 397#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 398#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 404#L31-2 assume !!(main_~j~0#1 < 20);main_~j~0#1 := main_~i~0#1 + main_~j~0#1; 403#L31-2 assume !(main_~j~0#1 < 20); 401#L31-3 main_~k~0#1 := 4; 395#L35-2 assume !(main_~k~0#1 <= 3); 396#L35-3 assume !!(main_~i~0#1 <= 100);main_~i~0#1 := 1 + main_~i~0#1; 402#L31-2 assume !(main_~j~0#1 < 20); 400#L31-3 main_~k~0#1 := 4; 394#L35-2 [2024-11-19 14:46:35,476 INFO L747 eck$LassoCheckResult]: Loop: 394#L35-2 assume !!(main_~k~0#1 <= 3);main_~k~0#1 := 1 + main_~k~0#1; 394#L35-2 [2024-11-19 14:46:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1938241212, now seen corresponding path program 2 times [2024-11-19 14:46:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571729751] [2024-11-19 14:46:35,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,486 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:35,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:35,581 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-19 14:46:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:46:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571729751] [2024-11-19 14:46:35,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571729751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:46:35,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750317044] [2024-11-19 14:46:35,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:35,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:46:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,608 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:46:35,609 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-19 14:46:35,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 14:46:35,640 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:46:35,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:46:35,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:35,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:46:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:46:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750317044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:46:35,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:46:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-19 14:46:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519856132] [2024-11-19 14:46:35,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:46:35,765 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:46:35,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2024-11-19 14:46:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:46:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466843068] [2024-11-19 14:46:35,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:46:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:46:35,769 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:46:35,770 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:46:35,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:46:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:46:35,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:46:35,781 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:35,781 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:35,781 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:35,781 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:35,781 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:46:35,781 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,781 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:35,781 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:35,781 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration6_Loop [2024-11-19 14:46:35,781 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:35,781 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:35,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,796 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:35,796 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:46:35,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,798 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-19 14:46:35,799 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-19 14:46:35,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:46:35,799 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:35,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:46:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,823 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-19 14:46:35,824 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-19 14:46:35,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:46:35,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:46:35,855 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:46:35,859 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-19 14:46:35,859 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:46:35,859 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:46:35,859 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:46:35,859 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:46:35,859 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:46:35,859 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:46:35,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:46:35,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration6_Loop [2024-11-19 14:46:35,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:46:35,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:46:35,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:46:35,879 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:46:35,879 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:46:35,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,881 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-19 14:46:35,882 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-19 14:46:35,884 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-19 14:46:35,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:46:35,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:46:35,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:46:35,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:46:35,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:46:35,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:46:35,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:46:35,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:46:35,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:46:35,898 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:46:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:46:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:46:35,900 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:46:35,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:46:35,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:46:35,901 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:46:35,901 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:46:35,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2024-11-19 14:46:35,913 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-19 14:46:35,914 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:46:35,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,952 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,953 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-19 14:46:35,953 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:46:35,953 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 14:46:35,960 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 28 transitions. Complement of second has 5 states. [2024-11-19 14:46:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 14:46:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-19 14:46:35,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 12 letters. Loop has 1 letters. [2024-11-19 14:46:35,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:35,961 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:35,989 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:35,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:35,989 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-19 14:46:35,989 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:46:35,990 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 14:46:35,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 28 transitions. Complement of second has 5 states. [2024-11-19 14:46:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 14:46:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-19 14:46:35,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 12 letters. Loop has 1 letters. [2024-11-19 14:46:35,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:35,999 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:46:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:46:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:46:36,032 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:46:36,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:46:36,032 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-19 14:46:36,033 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:46:36,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 14:46:36,040 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 22 transitions. Complement of second has 4 states. [2024-11-19 14:46:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:46:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 14:46:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-19 14:46:36,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 1 letters. [2024-11-19 14:46:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 13 letters. Loop has 1 letters. [2024-11-19 14:46:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-19 14:46:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:46:36,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2024-11-19 14:46:36,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:46:36,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2024-11-19 14:46:36,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:46:36,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:46:36,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:46:36,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:46:36,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:36,043 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:46:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 14:46:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-11-19 14:46:36,044 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-19 14:46:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:46:36,044 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-11-19 14:46:36,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-11-19 14:46:36,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:46:36,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 14:46:36,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:46:36,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:46:36,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:46:36,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:46:36,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:36,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:46:36,046 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:46:36,046 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:46:36,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:46:36,046 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:46:36,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:46:36,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:46:36 BoogieIcfgContainer [2024-11-19 14:46:36,053 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:46:36,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:46:36,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:46:36,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:46:36,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:46:33" (3/4) ... [2024-11-19 14:46:36,056 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:46:36,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:46:36,057 INFO L158 Benchmark]: Toolchain (without parser) took 3102.55ms. Allocated memory is still 169.9MB. Free memory was 141.7MB in the beginning and 98.1MB in the end (delta: 43.6MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-11-19 14:46:36,058 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:46:36,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.29ms. Allocated memory is still 169.9MB. Free memory was 141.3MB in the beginning and 128.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:46:36,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.17ms. Allocated memory is still 169.9MB. Free memory was 128.9MB in the beginning and 127.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:46:36,060 INFO L158 Benchmark]: Boogie Preprocessor took 32.12ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 126.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:46:36,060 INFO L158 Benchmark]: RCFGBuilder took 222.93ms. Allocated memory is still 169.9MB. Free memory was 126.0MB in the beginning and 116.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 14:46:36,060 INFO L158 Benchmark]: BuchiAutomizer took 2580.05ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 98.1MB in the end (delta: 18.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-19 14:46:36,060 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 169.9MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:46:36,061 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.18ms. Allocated memory is still 169.9MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.29ms. Allocated memory is still 169.9MB. Free memory was 141.3MB in the beginning and 128.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.17ms. Allocated memory is still 169.9MB. Free memory was 128.9MB in the beginning and 127.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.12ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 126.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.93ms. Allocated memory is still 169.9MB. Free memory was 126.0MB in the beginning and 116.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2580.05ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 98.1MB in the end (delta: 18.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 169.9MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 201) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * j) + ((long long) 39 * i)) and consists of 5 locations. One deterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. One nondeterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 88 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN1 SILU0 SILI0 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 47ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-19 14:46:36,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:36,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:36,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:46:36,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE