./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f 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/recursified_loop-invariants/recursified_const.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df68cc134d4c89196adaa50333a41be4199690de58eaf3e6fbecc9a5100092fe --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:43:31,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:43:31,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:43:31,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:43:31,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:43:31,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:43:31,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:43:31,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:43:31,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:43:31,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:43:31,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:43:31,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:43:31,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:43:31,621 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:43:31,621 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:43:31,621 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:43:31,622 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:43:31,622 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:43:31,622 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:43:31,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:43:31,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:43:31,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:43:31,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:43:31,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:43:31,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:43:31,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:43:31,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:43:31,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:43:31,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:43:31,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:43:31,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:43:31,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:43:31,629 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:43:31,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:43:31,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:43:31,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:43:31,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:43:31,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:43:31,630 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:43:31,630 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 -> df68cc134d4c89196adaa50333a41be4199690de58eaf3e6fbecc9a5100092fe [2024-11-12 21:43:31,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:43:31,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:43:31,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:43:31,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:43:31,862 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:43:31,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-invariants/recursified_const.c [2024-11-12 21:43:33,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:43:33,259 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:43:33,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-invariants/recursified_const.c [2024-11-12 21:43:33,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925689b52/8b2662d8b46d4f1098e64842883b0185/FLAGfdcbb77b8 [2024-11-12 21:43:33,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925689b52/8b2662d8b46d4f1098e64842883b0185 [2024-11-12 21:43:33,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:43:33,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:43:33,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:43:33,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:43:33,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:43:33,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea19132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33, skipping insertion in model container [2024-11-12 21:43:33,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:43:33,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:43:33,860 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:43:33,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:43:33,888 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:43:33,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33 WrapperNode [2024-11-12 21:43:33,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:43:33,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:43:33,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:43:33,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:43:33,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,925 INFO L138 Inliner]: procedures = 15, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2024-11-12 21:43:33,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:43:33,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:43:33,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:43:33,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:43:33,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,957 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 8, 5]. 53 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 8, 1]. The 1 writes are split as follows [0, 0, 1]. [2024-11-12 21:43:33,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:43:33,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:43:33,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:43:33,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:43:33,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (1/1) ... [2024-11-12 21:43:33,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:43:33,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:43:34,017 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-12 21:43:34,027 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-12 21:43:34,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:43:34,065 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_18_0 [2024-11-12 21:43:34,065 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_18_0 [2024-11-12 21:43:34,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:43:34,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:43:34,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 21:43:34,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 21:43:34,134 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:43:34,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:43:34,261 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-12 21:43:34,261 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:43:34,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:43:34,270 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 21:43:34,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:43:34 BoogieIcfgContainer [2024-11-12 21:43:34,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:43:34,272 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:43:34,272 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:43:34,276 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:43:34,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:43:34,276 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:43:33" (1/3) ... [2024-11-12 21:43:34,277 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e43b00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:43:34, skipping insertion in model container [2024-11-12 21:43:34,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:43:34,277 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:43:33" (2/3) ... [2024-11-12 21:43:34,277 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e43b00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:43:34, skipping insertion in model container [2024-11-12 21:43:34,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:43:34,277 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:43:34" (3/3) ... [2024-11-12 21:43:34,279 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_const.c [2024-11-12 21:43:34,351 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:43:34,351 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:43:34,351 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:43:34,351 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:43:34,351 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:43:34,352 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:43:34,352 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:43:34,352 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:43:34,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 21:43:34,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-12 21:43:34,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:43:34,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:43:34,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:43:34,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:43:34,395 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:43:34,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 21:43:34,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-11-12 21:43:34,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:43:34,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:43:34,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:43:34,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:43:34,403 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(99, 2, 0, 1);call write~init~int#1(111, 2, 1, 1);call write~init~int#1(110, 2, 2, 1);call write~init~int#1(115, 2, 3, 1);call write~init~int#1(116, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#s~0#1.base, main_~#s~0#1.offset;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(0, main_~#s~0#1.base, main_~#s~0#1.offset, 4);" "call func_to_recursive_line_13_to_18_0(main_~#s~0#1.base, main_~#s~0#1.offset);"< [2024-11-12 21:43:34,404 INFO L749 eck$LassoCheckResult]: Loop: "~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;havoc #t~nondet4#1;" "assume 0 != #t~nondet4#1 % 4294967296;havoc #t~nondet4#1;call #t~mem5#1 := read~int#2(~s#1.base, ~s#1.offset, 4);" "assume 0 != #t~mem5#1 % 4294967296;havoc #t~mem5#1;call #t~mem6#1 := read~int#2(~s#1.base, ~s#1.offset, 4);#t~pre7#1 := 1 + #t~mem6#1;call write~int#2(1 + #t~mem6#1, ~s#1.base, ~s#1.offset, 4);havoc #t~mem6#1;havoc #t~pre7#1;" "havoc #t~nondet8#1;" "assume !(0 != #t~nondet8#1 % 4294967296);havoc #t~nondet8#1;" "call func_to_recursive_line_13_to_18_0(~s#1.base, ~s#1.offset);"< [2024-11-12 21:43:34,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:43:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 63625, now seen corresponding path program 1 times [2024-11-12 21:43:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:43:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977539104] [2024-11-12 21:43:34,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:43:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:34,515 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:43:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:34,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:43:34,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:43:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 890463479, now seen corresponding path program 1 times [2024-11-12 21:43:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:43:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835511702] [2024-11-12 21:43:34,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:43:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:34,583 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:43:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:34,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:43:34,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:43:34,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1489622911, now seen corresponding path program 1 times [2024-11-12 21:43:34,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:43:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409537136] [2024-11-12 21:43:34,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:43:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:43:34,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:43:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409537136] [2024-11-12 21:43:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409537136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:43:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020117245] [2024-11-12 21:43:34,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:34,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:43:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:43:34,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:43:34,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:43:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:43:35,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 21:43:35,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:43:35,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:43:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020117245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:43:35,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:43:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 21:43:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521568774] [2024-11-12 21:43:35,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:43:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:43:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 21:43:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 21:43:35,371 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:43:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:43:35,482 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-12 21:43:35,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2024-11-12 21:43:35,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-12 21:43:35,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 11 states and 12 transitions. [2024-11-12 21:43:35,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-12 21:43:35,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-12 21:43:35,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2024-11-12 21:43:35,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:43:35,494 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-12 21:43:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2024-11-12 21:43:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-12 21:43:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:43:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-12 21:43:35,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-12 21:43:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 21:43:35,538 INFO L426 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-12 21:43:35,539 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:43:35,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2024-11-12 21:43:35,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-12 21:43:35,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:43:35,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:43:35,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:43:35,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:43:35,542 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call write~init~int#1(99, 2, 0, 1);call write~init~int#1(111, 2, 1, 1);call write~init~int#1(110, 2, 2, 1);call write~init~int#1(115, 2, 3, 1);call write~init~int#1(116, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#s~0#1.base, main_~#s~0#1.offset;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(0, main_~#s~0#1.base, main_~#s~0#1.offset, 4);" "call func_to_recursive_line_13_to_18_0(main_~#s~0#1.base, main_~#s~0#1.offset);"< [2024-11-12 21:43:35,542 INFO L749 eck$LassoCheckResult]: Loop: "~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;havoc #t~nondet4#1;" "assume 0 != #t~nondet4#1 % 4294967296;havoc #t~nondet4#1;call #t~mem5#1 := read~int#2(~s#1.base, ~s#1.offset, 4);" "assume !(0 != #t~mem5#1 % 4294967296);havoc #t~mem5#1;" "havoc #t~nondet8#1;" "assume !(0 != #t~nondet8#1 % 4294967296);havoc #t~nondet8#1;" "call func_to_recursive_line_13_to_18_0(~s#1.base, ~s#1.offset);"< [2024-11-12 21:43:35,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:43:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash 63625, now seen corresponding path program 2 times [2024-11-12 21:43:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:43:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376422694] [2024-11-12 21:43:35,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:35,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:43:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:35,552 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:43:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:35,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:43:35,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:43:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash 890523061, now seen corresponding path program 1 times [2024-11-12 21:43:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:43:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184167233] [2024-11-12 21:43:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:43:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:35,586 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:43:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:35,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:43:35,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:43:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1489682493, now seen corresponding path program 1 times [2024-11-12 21:43:35,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:43:35,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574002992] [2024-11-12 21:43:35,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:43:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:43:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:35,614 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:43:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:35,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:43:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:36,280 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:43:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:43:36,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:43:36 BoogieIcfgContainer [2024-11-12 21:43:36,306 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:43:36,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:43:36,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:43:36,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:43:36,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:43:34" (3/4) ... [2024-11-12 21:43:36,309 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:43:36,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:43:36,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:43:36,342 INFO L158 Benchmark]: Toolchain (without parser) took 2668.19ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 81.6MB in the beginning and 82.0MB in the end (delta: -361.0kB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,342 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:43:36,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.51ms. Allocated memory is still 151.0MB. Free memory was 81.4MB in the beginning and 69.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 151.0MB. Free memory was 69.4MB in the beginning and 68.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,344 INFO L158 Benchmark]: Boogie Preprocessor took 44.18ms. Allocated memory is still 151.0MB. Free memory was 67.8MB in the beginning and 65.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,346 INFO L158 Benchmark]: RCFGBuilder took 299.86ms. Allocated memory is still 151.0MB. Free memory was 65.9MB in the beginning and 54.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,346 INFO L158 Benchmark]: BuchiAutomizer took 2034.10ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 54.1MB in the beginning and 84.1MB in the end (delta: -30.0MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,346 INFO L158 Benchmark]: Witness Printer took 34.51ms. Allocated memory is still 205.5MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:43:36,348 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.19ms. Allocated memory is still 151.0MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.51ms. Allocated memory is still 151.0MB. Free memory was 81.4MB in the beginning and 69.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 151.0MB. Free memory was 69.4MB in the beginning and 68.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.18ms. Allocated memory is still 151.0MB. Free memory was 67.8MB in the beginning and 65.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 299.86ms. Allocated memory is still 151.0MB. Free memory was 65.9MB in the beginning and 54.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2034.10ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 54.1MB in the beginning and 84.1MB in the end (delta: -30.0MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 34.51ms. Allocated memory is still 205.5MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 13 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 38]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L67] unsigned int s = 0; [L67] unsigned int s = 0; [L68] CALL func_to_recursive_line_13_to_18_0(&s) Loop: [L40] COND TRUE __VERIFIER_nondet_uint() [L43] EXPR \read(*s) [L43] COND FALSE !((*s) != 0) [L50] COND FALSE !(__VERIFIER_nondet_uint()) [L58] CALL func_to_recursive_line_13_to_18_0(s) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L67] unsigned int s = 0; [L67] unsigned int s = 0; [L68] CALL func_to_recursive_line_13_to_18_0(&s) Loop: [L40] COND TRUE __VERIFIER_nondet_uint() [L43] EXPR \read(*s) [L43] COND FALSE !((*s) != 0) [L50] COND FALSE !(__VERIFIER_nondet_uint()) [L58] CALL func_to_recursive_line_13_to_18_0(s) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:43:36,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 21:43:36,578 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)