./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:04:31,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:04:31,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:04:31,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:04:31,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:04:31,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:04:31,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:04:31,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:04:31,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:04:31,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:04:31,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:04:31,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:04:31,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:04:31,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:04:31,546 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:04:31,547 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:04:31,547 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:04:31,547 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:04:31,547 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:04:31,547 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:04:31,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:04:31,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:04:31,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:04:31,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:04:31,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:04:31,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:04:31,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:04:31,550 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:04:31,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:04:31,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:04:31,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:04:31,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:04:31,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:04:31,551 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:04:31,551 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 -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 [2024-11-10 23:04:31,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:04:31,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:04:31,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:04:31,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:04:31,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:04:31,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-11-10 23:04:33,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:04:33,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:04:33,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-11-10 23:04:33,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb86be056/e000abf17a604bf2b1aa09c0a3cc5234/FLAG55cb4e48d [2024-11-10 23:04:33,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb86be056/e000abf17a604bf2b1aa09c0a3cc5234 [2024-11-10 23:04:33,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:04:33,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:04:33,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:04:33,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:04:33,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:04:33,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb07e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33, skipping insertion in model container [2024-11-10 23:04:33,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:04:33,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:04:33,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:04:33,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:04:33,520 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:04:33,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33 WrapperNode [2024-11-10 23:04:33,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:04:33,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:04:33,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:04:33,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:04:33,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,547 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 19, calls inlined = 34, statements flattened = 204 [2024-11-10 23:04:33,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:04:33,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:04:33,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:04:33,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:04:33,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,566 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 23:04:33,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:04:33,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:04:33,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:04:33,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:04:33,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (1/1) ... [2024-11-10 23:04:33,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:04:33,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:04:33,607 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-10 23:04:33,609 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-10 23:04:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:04:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:04:33,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:04:33,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:04:33,736 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:04:33,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:04:33,944 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-10 23:04:33,944 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:04:33,954 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:04:33,954 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:04:33,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:33 BoogieIcfgContainer [2024-11-10 23:04:33,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:04:33,955 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:04:33,955 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:04:33,958 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:04:33,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:33,959 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:04:33" (1/3) ... [2024-11-10 23:04:33,959 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176a5172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:33, skipping insertion in model container [2024-11-10 23:04:33,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:33,960 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:33" (2/3) ... [2024-11-10 23:04:33,960 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176a5172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:33, skipping insertion in model container [2024-11-10 23:04:33,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:04:33,960 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:33" (3/3) ... [2024-11-10 23:04:33,961 INFO L332 chiAutomizerObserver]: Analyzing ICFG SpamAssassin-loop.i [2024-11-10 23:04:33,996 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:04:33,996 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:04:33,996 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:04:33,997 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:04:33,997 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:04:33,997 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:04:33,997 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:04:33,997 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:04:34,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 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-10 23:04:34,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 87 [2024-11-10 23:04:34,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:34,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:34,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:04:34,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 23:04:34,018 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:04:34,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 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-10 23:04:34,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 87 [2024-11-10 23:04:34,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:34,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:34,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:04:34,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 23:04:34,027 INFO L745 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 37#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;havoc main_#t~nondet1#1;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 89#L31-1true assume !(main_~bufsize~0#1 < 0);havoc main_#t~nondet2#1;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; 38#L34true [2024-11-10 23:04:34,027 INFO L747 eck$LassoCheckResult]: Loop: 38#L34true assume true; 60#L34-1true assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; 70#L35true assume !true; 38#L34true [2024-11-10 23:04:34,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 183673, now seen corresponding path program 1 times [2024-11-10 23:04:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:34,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735022421] [2024-11-10 23:04:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:34,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 175726, now seen corresponding path program 1 times [2024-11-10 23:04:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724657920] [2024-11-10 23:04:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:04:34,147 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-10 23:04:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:04:34,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724657920] [2024-11-10 23:04:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724657920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:04:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:04:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 23:04:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497965525] [2024-11-10 23:04:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:04:34,153 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:04:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:04:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 23:04:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 23:04:34,180 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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-10 23:04:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:04:34,191 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-10 23:04:34,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2024-11-10 23:04:34,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2024-11-10 23:04:34,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 42 states and 45 transitions. [2024-11-10 23:04:34,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-10 23:04:34,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-10 23:04:34,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 45 transitions. [2024-11-10 23:04:34,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:04:34,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-10 23:04:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 45 transitions. [2024-11-10 23:04:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 23:04:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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-10 23:04:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-10 23:04:34,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-10 23:04:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 23:04:34,225 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-10 23:04:34,225 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:04:34,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 45 transitions. [2024-11-10 23:04:34,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2024-11-10 23:04:34,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:04:34,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:04:34,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:04:34,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 23:04:34,229 INFO L745 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 213#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;havoc main_#t~nondet1#1;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 221#L31-1 assume !(main_~bufsize~0#1 < 0);havoc main_#t~nondet2#1;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; 188#L34 [2024-11-10 23:04:34,229 INFO L747 eck$LassoCheckResult]: Loop: 188#L34 assume true; 194#L34-1 assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; 195#L35 assume true; 187#L35-1 assume !(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); 188#L34 [2024-11-10 23:04:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 183673, now seen corresponding path program 2 times [2024-11-10 23:04:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083541359] [2024-11-10 23:04:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:34,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 5447614, now seen corresponding path program 1 times [2024-11-10 23:04:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271662858] [2024-11-10 23:04:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:34,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:04:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2126672182, now seen corresponding path program 1 times [2024-11-10 23:04:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:04:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241091410] [2024-11-10 23:04:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:04:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:04:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:04:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:04:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:04:34,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:04:34 BoogieIcfgContainer [2024-11-10 23:04:34,498 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:04:34,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:04:34,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:04:34,499 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:04:34,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:04:33" (3/4) ... [2024-11-10 23:04:34,502 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 23:04:34,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 23:04:34,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:04:34,527 INFO L158 Benchmark]: Toolchain (without parser) took 1229.56ms. Allocated memory is still 186.6MB. Free memory was 117.7MB in the beginning and 104.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,528 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 81.5MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:04:34,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.30ms. Allocated memory is still 186.6MB. Free memory was 117.5MB in the beginning and 104.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.37ms. Allocated memory is still 186.6MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,529 INFO L158 Benchmark]: Boogie Preprocessor took 25.85ms. Allocated memory is still 186.6MB. Free memory was 102.6MB in the beginning and 100.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,529 INFO L158 Benchmark]: IcfgBuilder took 380.28ms. Allocated memory is still 186.6MB. Free memory was 100.7MB in the beginning and 145.5MB in the end (delta: -44.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,529 INFO L158 Benchmark]: BuchiAutomizer took 542.89ms. Allocated memory is still 186.6MB. Free memory was 145.5MB in the beginning and 106.6MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,530 INFO L158 Benchmark]: Witness Printer took 28.25ms. Allocated memory is still 186.6MB. Free memory was 106.6MB in the beginning and 104.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:04:34,531 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.14ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 81.5MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.30ms. Allocated memory is still 186.6MB. Free memory was 117.5MB in the beginning and 104.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.37ms. Allocated memory is still 186.6MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.85ms. Allocated memory is still 186.6MB. Free memory was 102.6MB in the beginning and 100.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 380.28ms. Allocated memory is still 186.6MB. Free memory was 100.7MB in the beginning and 145.5MB in the end (delta: -44.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 542.89ms. Allocated memory is still 186.6MB. Free memory was 145.5MB in the beginning and 106.6MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 28.25ms. Allocated memory is still 186.6MB. Free memory was 106.6MB in the beginning and 104.7MB in the end (delta: 1.9MB). 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 2 locations. The remainder module has 42 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 82 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 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: 34]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L26] int len; [L27] int i; [L28] int j; [L29] int bufsize; [L30] bufsize = __VERIFIER_nondet_int() [L31] COND FALSE !(bufsize < 0) [L32] len = __VERIFIER_nondet_int() [L33] int limit = bufsize - 4; [L34] i = 0 VAL [bufsize=4, i=0, limit=0] Loop: [L34] COND TRUE i < len [L35] j = 0 [L35] COND FALSE !(i < len && j < limit) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 34]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L26] int len; [L27] int i; [L28] int j; [L29] int bufsize; [L30] bufsize = __VERIFIER_nondet_int() [L31] COND FALSE !(bufsize < 0) [L32] len = __VERIFIER_nondet_int() [L33] int limit = bufsize - 4; [L34] i = 0 VAL [bufsize=4, i=0, limit=0] Loop: [L34] COND TRUE i < len [L35] j = 0 [L35] COND FALSE !(i < len && j < limit) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 23:04:34,559 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)