./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/nec11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/nec11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b78564a93d1d434db2fa377a9b33de67cda5b233a427ae8d3550b20661e154a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:32:23,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:32:23,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:32:23,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:32:23,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:32:23,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:32:23,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:32:23,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:32:23,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:32:23,939 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:32:23,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:32:23,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:32:23,939 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:32:23,939 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:32:23,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:32:23,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:32:23,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:32:23,942 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:32:23,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:32:23,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:32:23,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:32:23,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:32:23,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:32:23,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:32:23,943 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:32:23,943 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> b78564a93d1d434db2fa377a9b33de67cda5b233a427ae8d3550b20661e154a3 [2025-01-10 07:32:24,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:32:24,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:32:24,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:32:24,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:32:24,205 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:32:24,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/nec11.c [2025-01-10 07:32:25,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9d66ade/2ab81616aa3d44faa1601ef57fed6749/FLAG58ffbcacb [2025-01-10 07:32:25,893 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:32:25,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2025-01-10 07:32:25,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9d66ade/2ab81616aa3d44faa1601ef57fed6749/FLAG58ffbcacb [2025-01-10 07:32:26,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9d66ade/2ab81616aa3d44faa1601ef57fed6749 [2025-01-10 07:32:26,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:32:26,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:32:26,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:32:26,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:32:26,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:32:26,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38dd4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26, skipping insertion in model container [2025-01-10 07:32:26,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:32:26,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:32:26,345 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:32:26,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:32:26,366 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:32:26,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26 WrapperNode [2025-01-10 07:32:26,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:32:26,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:32:26,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:32:26,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:32:26,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,389 INFO L138 Inliner]: procedures = 13, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-01-10 07:32:26,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:32:26,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:32:26,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:32:26,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:32:26,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,407 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-10 07:32:26,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:32:26,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:32:26,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:32:26,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:32:26,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (1/1) ... [2025-01-10 07:32:26,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:32:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:26,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:32:26,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:32:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:32:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:32:26,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:32:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:32:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:32:26,512 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:32:26,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:32:26,589 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-10 07:32:26,589 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:32:26,596 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:32:26,596 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:32:26,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:26 BoogieIcfgContainer [2025-01-10 07:32:26,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:32:26,597 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:32:26,598 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:32:26,601 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:32:26,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:26,602 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:32:26" (1/3) ... [2025-01-10 07:32:26,603 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51813d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:32:26, skipping insertion in model container [2025-01-10 07:32:26,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:26,604 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:32:26" (2/3) ... [2025-01-10 07:32:26,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51813d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:32:26, skipping insertion in model container [2025-01-10 07:32:26,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:32:26,605 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:26" (3/3) ... [2025-01-10 07:32:26,606 INFO L363 chiAutomizerObserver]: Analyzing ICFG nec11.c [2025-01-10 07:32:26,639 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:32:26,639 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:32:26,639 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:32:26,639 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:32:26,639 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:32:26,639 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:32:26,639 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:32:26,640 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:32:26,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2025-01-10 07:32:26,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:26,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:26,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:26,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:32:26,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:26,655 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:32:26,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2025-01-10 07:32:26,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:26,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:26,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:26,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:32:26,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:26,661 INFO L752 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(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 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_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1;" [2025-01-10 07:32:26,661 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 != main_~c~0#1 % 256;" "assume 4 == main_~len~0#1;main_~len~0#1 := 0;" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-01-10 07:32:26,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:32:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42254533] [2025-01-10 07:32:26,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:26,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:26,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:32:26,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:32:26,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 35849, now seen corresponding path program 1 times [2025-01-10 07:32:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151612507] [2025-01-10 07:32:26,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:26,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:26,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:26,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:26,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:26,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash 28694791, now seen corresponding path program 1 times [2025-01-10 07:32:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572793165] [2025-01-10 07:32:26,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:32:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:32:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:26,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572793165] [2025-01-10 07:32:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572793165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:32:26,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:32:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:32:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822573257] [2025-01-10 07:32:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:32:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:26,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:32:26,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:32:26,925 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:26,937 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-01-10 07:32:26,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-01-10 07:32:26,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:32:26,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 8 states and 9 transitions. [2025-01-10 07:32:26,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:32:26,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:32:26,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2025-01-10 07:32:26,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:26,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:32:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2025-01-10 07:32:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2025-01-10 07:32:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-01-10 07:32:26,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-01-10 07:32:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:32:26,962 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-01-10 07:32:26,962 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:32:26,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-01-10 07:32:26,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:32:26,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:26,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:26,963 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:32:26,963 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:32:26,963 INFO L752 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(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 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_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1;" "assume 0 != main_~c~0#1 % 256;" "assume !(4 == main_~len~0#1);" [2025-01-10 07:32:26,963 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume 0 != main_~c~0#1 % 256;" "assume 4 == main_~len~0#1;main_~len~0#1 := 0;" [2025-01-10 07:32:26,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 07:32:26,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425525439] [2025-01-10 07:32:26,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:26,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:26,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:26,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:26,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:26,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash 42479, now seen corresponding path program 2 times [2025-01-10 07:32:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967455220] [2025-01-10 07:32:26,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:26,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:26,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:26,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:32:26,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:26,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:32:26,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:32:26,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:26,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:26,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:26,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1805950152, now seen corresponding path program 1 times [2025-01-10 07:32:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195059274] [2025-01-10 07:32:26,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:27,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:32:27,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:32:27,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:32:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195059274] [2025-01-10 07:32:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195059274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:32:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469581719] [2025-01-10 07:32:27,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:27,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:32:27,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:32:27,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:32:27,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:32:27,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:32:27,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:32:27,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:32:27,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:32:27,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:32:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:27,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:32:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:32:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469581719] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:32:27,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:32:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 07:32:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828278329] [2025-01-10 07:32:27,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:32:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:32:27,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:32:27,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:32:27,198 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:32:27,218 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-01-10 07:32:27,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2025-01-10 07:32:27,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-01-10 07:32:27,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2025-01-10 07:32:27,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:32:27,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:32:27,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2025-01-10 07:32:27,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:32:27,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-01-10 07:32:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2025-01-10 07:32:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-01-10 07:32:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:32:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-01-10 07:32:27,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 07:32:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:32:27,222 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 07:32:27,222 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:32:27,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2025-01-10 07:32:27,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-01-10 07:32:27,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:32:27,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:32:27,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:32:27,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2025-01-10 07:32:27,223 INFO L752 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(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 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_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1;" "assume 0 != main_~c~0#1 % 256;" "assume !(4 == main_~len~0#1);" [2025-01-10 07:32:27,223 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume 0 != main_~c~0#1 % 256;" "assume !(4 == main_~len~0#1);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume 0 != main_~c~0#1 % 256;" "assume !(4 == main_~len~0#1);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume 0 != main_~c~0#1 % 256;" "assume !(4 == main_~len~0#1);" "assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume 0 != main_~c~0#1 % 256;" "assume 4 == main_~len~0#1;main_~len~0#1 := 0;" [2025-01-10 07:32:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 2 times [2025-01-10 07:32:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352893978] [2025-01-10 07:32:27,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:27,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:27,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:27,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:32:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:27,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:27,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:27,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:27,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1573227521, now seen corresponding path program 1 times [2025-01-10 07:32:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325356175] [2025-01-10 07:32:27,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:32:27,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:27,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:32:27,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:32:27,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:32:27,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:32:27,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:27,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:32:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1122771270, now seen corresponding path program 2 times [2025-01-10 07:32:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:32:27,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721160328] [2025-01-10 07:32:27,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:32:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:32:27,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 07:32:27,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:32:27,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:32:27,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:27,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:32:27,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:32:27,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:32:27,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:27,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:27,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:32:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:32:27,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:32:27,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:32:27,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:32:27,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:32:27 BoogieIcfgContainer [2025-01-10 07:32:27,651 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:32:27,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:32:27,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:32:27,652 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:32:27,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:32:26" (3/4) ... [2025-01-10 07:32:27,653 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:32:27,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:32:27,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:32:27,678 INFO L158 Benchmark]: Toolchain (without parser) took 1460.40ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 95.7MB in the end (delta: 25.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-01-10 07:32:27,678 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:27,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.84ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 110.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:32:27,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.45ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.1MB in the end (delta: 869.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:27,678 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 109.2MB in the end (delta: 881.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:27,679 INFO L158 Benchmark]: RCFGBuilder took 174.65ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 98.7MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:32:27,679 INFO L158 Benchmark]: BuchiAutomizer took 1053.52ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 99.3MB in the end (delta: -659.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:27,679 INFO L158 Benchmark]: Witness Printer took 25.59ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 95.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:32:27,680 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.20ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.84ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 110.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.45ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.1MB in the end (delta: 869.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 109.2MB in the end (delta: 881.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 174.65ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 98.7MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1053.52ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 99.3MB in the end (delta: -659.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 25.59ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 95.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:4. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 13 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 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: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; VAL [c=1, len=0] [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) VAL [c=1, len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; VAL [c=1, len=0] [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) VAL [c=1, len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:32:27,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 07:32:27,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)