./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d 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/termination-memory-alloca/b.05-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:24:33,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:24:33,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:24:33,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:24:33,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:24:33,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:24:33,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:24:33,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:24:33,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:24:33,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:24:33,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:24:33,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:24:33,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:24:33,236 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:24:33,237 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:24:33,237 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:24:33,237 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:24:33,238 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:24:33,238 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:24:33,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:24:33,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:24:33,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:24:33,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:24:33,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:24:33,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:24:33,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:24:33,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:24:33,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:24:33,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:24:33,241 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:24:33,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:24:33,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:24:33,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:24:33,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:24:33,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:24:33,243 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:24:33,243 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d [2024-11-09 15:24:33,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:24:33,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:24:33,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:24:33,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:24:33,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:24:33,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2024-11-09 15:24:35,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:24:35,242 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:24:35,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2024-11-09 15:24:35,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23dc38e7/7c962e265b634899ab73d686b9ccb318/FLAG57c8a3851 [2024-11-09 15:24:35,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23dc38e7/7c962e265b634899ab73d686b9ccb318 [2024-11-09 15:24:35,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:24:35,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:24:35,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:24:35,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:24:35,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:24:35,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:24:35" (1/1) ... [2024-11-09 15:24:35,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36dcaf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:35, skipping insertion in model container [2024-11-09 15:24:35,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:24:35" (1/1) ... [2024-11-09 15:24:35,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:24:35,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:24:35,924 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:24:35,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:24:36,005 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:24:36,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36 WrapperNode [2024-11-09 15:24:36,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:24:36,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:24:36,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:24:36,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:24:36,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,044 INFO L138 Inliner]: procedures = 111, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-11-09 15:24:36,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:24:36,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:24:36,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:24:36,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:24:36,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,067 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [6, 5]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [3, 2]. [2024-11-09 15:24:36,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:24:36,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:24:36,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:24:36,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:24:36,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (1/1) ... [2024-11-09 15:24:36,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:36,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:36,113 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-09 15:24:36,115 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-09 15:24:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:24:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:24:36,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:24:36,283 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:24:36,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:24:36,404 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 15:24:36,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:24:36,414 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:24:36,414 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:24:36,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:36 BoogieIcfgContainer [2024-11-09 15:24:36,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:24:36,415 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:24:36,416 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:24:36,419 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:24:36,420 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:36,420 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:24:35" (1/3) ... [2024-11-09 15:24:36,421 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80d45af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:24:36, skipping insertion in model container [2024-11-09 15:24:36,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:36,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:24:36" (2/3) ... [2024-11-09 15:24:36,422 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@80d45af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:24:36, skipping insertion in model container [2024-11-09 15:24:36,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:24:36,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:36" (3/3) ... [2024-11-09 15:24:36,424 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i [2024-11-09 15:24:36,474 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:24:36,475 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:24:36,475 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:24:36,475 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:24:36,475 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:24:36,475 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:24:36,475 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:24:36,476 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:24:36,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-09 15:24:36,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:24:36,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:36,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:36,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:24:36,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:24:36,502 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:24:36,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-09 15:24:36,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:24:36,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:36,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:36,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:24:36,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:24:36,512 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#0(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1; 10#L554-11true [2024-11-09 15:24:36,514 INFO L747 eck$LassoCheckResult]: Loop: 10#L554-11true call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 4#L554-1true assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 >= 0; 13#L554-3true test_fun_#t~short9#1 := test_fun_#t~short7#1; 7#L554-4true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824; 14#L554-6true test_fun_#t~short11#1 := test_fun_#t~short9#1; 9#L554-7true assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1; 3#L554-9true assume !!test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#0(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1; 10#L554-11true [2024-11-09 15:24:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:24:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132824439] [2024-11-09 15:24:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:36,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:36,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:36,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times [2024-11-09 15:24:36,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:36,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326555056] [2024-11-09 15:24:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:36,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:36,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:36,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times [2024-11-09 15:24:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728027047] [2024-11-09 15:24:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:36,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:36,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:37,538 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:24:37,538 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:24:37,539 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:24:37,539 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:24:37,539 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:24:37,539 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:37,539 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:24:37,539 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:24:37,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso [2024-11-09 15:24:37,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:24:37,541 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:24:37,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:37,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:24:38,364 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:24:38,368 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:24:38,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,372 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-09 15:24:38,373 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-09 15:24:38,375 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-09 15:24:38,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:38,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:38,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:38,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:38,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:38,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:38,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:38,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:38,407 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-09 15:24:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,410 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-09 15:24:38,411 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-09 15:24:38,413 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-09 15:24:38,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:38,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:38,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:38,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:38,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:38,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:38,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:38,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:38,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:24:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,446 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-09 15:24:38,447 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-09 15:24:38,448 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-09 15:24:38,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:38,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:38,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:38,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:38,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:38,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:38,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:38,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:38,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,479 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-09 15:24:38,480 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-09 15:24:38,481 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-09 15:24:38,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:38,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:24:38,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:38,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:38,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:38,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:24:38,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:24:38,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:38,504 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-09 15:24:38,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,506 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-09 15:24:38,508 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-09 15:24:38,510 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-09 15:24:38,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:38,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:38,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:38,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:38,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:38,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:38,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:24:38,550 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-09 15:24:38,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,553 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-09 15:24:38,556 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-09 15:24:38,556 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-09 15:24:38,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:24:38,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:24:38,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:24:38,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:24:38,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:24:38,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:24:38,603 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:24:38,652 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-09 15:24:38,652 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-09 15:24:38,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:24:38,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:24:38,674 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-09 15:24:38,676 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-09 15:24:38,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:24:38,696 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:24:38,696 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:24:38,696 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2024-11-09 15:24:38,712 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-09 15:24:38,748 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-09 15:24:38,760 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 15:24:38,760 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 15:24:38,761 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-09 15:24:38,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:38,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:24:38,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:38,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:24:38,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:24:38,974 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-09 15:24:38,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:24:39,011 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 15:24:39,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-09 15:24:39,106 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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). Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 42 states and 57 transitions. Complement of second has 10 states. [2024-11-09 15:24:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 15:24:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-09 15:24:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2024-11-09 15:24:39,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2024-11-09 15:24:39,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:39,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2024-11-09 15:24:39,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:39,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2024-11-09 15:24:39,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:24:39,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2024-11-09 15:24:39,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:24:39,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2024-11-09 15:24:39,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:24:39,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:24:39,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2024-11-09 15:24:39,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:39,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-11-09 15:24:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2024-11-09 15:24:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-09 15:24:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2024-11-09 15:24:39,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2024-11-09 15:24:39,158 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2024-11-09 15:24:39,158 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:24:39,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2024-11-09 15:24:39,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:24:39,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:39,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:39,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:24:39,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:24:39,161 INFO L745 eck$LassoCheckResult]: Stem: 180#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#0(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1; 186#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 173#L554-1 [2024-11-09 15:24:39,161 INFO L747 eck$LassoCheckResult]: Loop: 173#L554-1 assume !test_fun_#t~short7#1; 176#L554-3 test_fun_#t~short9#1 := test_fun_#t~short7#1; 177#L554-4 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824; 183#L554-6 test_fun_#t~short11#1 := test_fun_#t~short9#1; 167#L554-7 assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1; 168#L554-9 assume !!test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#0(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1; 171#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 173#L554-1 [2024-11-09 15:24:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 15:24:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585043148] [2024-11-09 15:24:39,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:39,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:39,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:39,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times [2024-11-09 15:24:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781135797] [2024-11-09 15:24:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:39,309 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-09 15:24:39,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781135797] [2024-11-09 15:24:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781135797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:39,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:24:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742665533] [2024-11-09 15:24:39,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:39,316 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:24:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:24:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:24:39,320 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-09 15:24:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:39,348 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2024-11-09 15:24:39,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-11-09 15:24:39,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:24:39,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 31 transitions. [2024-11-09 15:24:39,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:24:39,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:24:39,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2024-11-09 15:24:39,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:24:39,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-09 15:24:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2024-11-09 15:24:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-09 15:24:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:24:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-09 15:24:39,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-09 15:24:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:24:39,360 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-09 15:24:39,360 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:24:39,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2024-11-09 15:24:39,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-09 15:24:39,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:24:39,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:24:39,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:24:39,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:24:39,364 INFO L745 eck$LassoCheckResult]: Stem: 229#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#1(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#0(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1; 236#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 227#L554-1 [2024-11-09 15:24:39,364 INFO L747 eck$LassoCheckResult]: Loop: 227#L554-1 assume !test_fun_#t~short7#1; 231#L554-3 test_fun_#t~short9#1 := test_fun_#t~short7#1; 232#L554-4 assume !test_fun_#t~short9#1; 237#L554-6 test_fun_#t~short11#1 := test_fun_#t~short9#1; 221#L554-7 assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#0(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1; 222#L554-9 assume !!test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#0(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1; 225#L554-11 call test_fun_#t~mem5#1 := read~int#1(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0; 227#L554-1 [2024-11-09 15:24:39,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2024-11-09 15:24:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:39,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961816362] [2024-11-09 15:24:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:39,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:24:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:24:39,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:24:39,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:24:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times [2024-11-09 15:24:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:24:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406398335] [2024-11-09 15:24:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:24:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:24:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:24:39,455 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-09 15:24:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:24:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406398335] [2024-11-09 15:24:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406398335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:24:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:24:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 15:24:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511161210] [2024-11-09 15:24:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:24:39,457 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:24:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:24:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:24:39,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:24:39,458 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-09 15:24:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:24:39,481 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-09 15:24:39,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2024-11-09 15:24:39,481 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:24:39,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2024-11-09 15:24:39,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:24:39,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:24:39,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:24:39,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:24:39,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:24:39,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:24:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:24:39,484 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:24:39,484 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:24:39,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:24:39,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:24:39,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:24:39,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:24:39 BoogieIcfgContainer [2024-11-09 15:24:39,496 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:24:39,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:24:39,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:24:39,497 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:24:39,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:24:36" (3/4) ... [2024-11-09 15:24:39,499 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:24:39,500 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:24:39,501 INFO L158 Benchmark]: Toolchain (without parser) took 3906.86ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 118.0MB in the beginning and 134.4MB in the end (delta: -16.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,502 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 65.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:24:39,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.79ms. Allocated memory is still 169.9MB. Free memory was 117.8MB in the beginning and 99.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.94ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,504 INFO L158 Benchmark]: Boogie Preprocessor took 34.63ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,504 INFO L158 Benchmark]: RCFGBuilder took 334.71ms. Allocated memory is still 169.9MB. Free memory was 95.6MB in the beginning and 128.1MB in the end (delta: -32.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,506 INFO L158 Benchmark]: BuchiAutomizer took 3080.59ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 128.1MB in the beginning and 135.5MB in the end (delta: -7.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,506 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 205.5MB. Free memory was 135.5MB in the beginning and 134.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:24:39,508 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.13ms. Allocated memory is still 100.7MB. Free memory was 65.6MB in the beginning and 65.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.79ms. Allocated memory is still 169.9MB. Free memory was 117.8MB in the beginning and 99.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.94ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 97.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.63ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.71ms. Allocated memory is still 169.9MB. Free memory was 95.6MB in the beginning and 128.1MB in the end (delta: -32.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 3080.59ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 128.1MB in the beginning and 135.5MB in the end (delta: -7.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 205.5MB. Free memory was 135.5MB in the beginning and 134.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 26 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax109 hnf100 lsp90 ukn76 mio100 lsp31 div100 bol100 ite100 ukn100 eq195 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 15:24:39,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE