./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-3.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/psyco/psyco_abp_1-3.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 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:27:26,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:27:26,310 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:27:26,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:27:26,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:27:26,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:27:26,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:27:26,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:27:26,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:27:26,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:27:26,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:27:26,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:27:26,343 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:27:26,343 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:27:26,343 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:27:26,343 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:27:26,343 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:27:26,343 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:27:26,343 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:27:26,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:27:26,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:27:26,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:27:26,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:27:26,345 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:27:26,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:27:26,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:27:26,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:27:26,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:27:26,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:27:26,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:27:26,346 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:27:26,346 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 -> 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc [2025-01-10 07:27:26,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:27:26,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:27:26,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:27:26,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:27:26,659 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:27:26,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2025-01-10 07:27:27,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4bb18150/cc03b1920f3b464f9c69f1f8925d9f7f/FLAGd6194b2ef [2025-01-10 07:27:28,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:27:28,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2025-01-10 07:27:28,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4bb18150/cc03b1920f3b464f9c69f1f8925d9f7f/FLAGd6194b2ef [2025-01-10 07:27:28,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4bb18150/cc03b1920f3b464f9c69f1f8925d9f7f [2025-01-10 07:27:28,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:27:28,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:27:28,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:27:28,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:27:28,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:27:28,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152a8622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28, skipping insertion in model container [2025-01-10 07:27:28,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:27:28,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:27:28,469 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:27:28,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:27:28,555 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:27:28,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28 WrapperNode [2025-01-10 07:27:28,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:27:28,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:27:28,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:27:28,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:27:28,566 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:27:28" (1/1) ... [2025-01-10 07:27:28,584 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:27:28" (1/1) ... [2025-01-10 07:27:28,614 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 414 [2025-01-10 07:27:28,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:27:28,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:27:28,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:27:28,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:27:28,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,652 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]. [2025-01-10 07:27:28,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:27:28,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:27:28,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:27:28,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:27:28,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (1/1) ... [2025-01-10 07:27:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:27:28,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:27:28,722 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:27:28,724 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:27:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:27:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:27:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:27:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:27:28,811 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:27:28,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:27:29,579 INFO L? ?]: Removed 271 outVars from TransFormulas that were not future-live. [2025-01-10 07:27:29,580 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:27:29,591 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:27:29,591 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 07:27:29,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:27:29 BoogieIcfgContainer [2025-01-10 07:27:29,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:27:29,593 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:27:29,593 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:27:29,597 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:27:29,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:27:29,597 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:27:28" (1/3) ... [2025-01-10 07:27:29,598 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dcdd91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:27:29, skipping insertion in model container [2025-01-10 07:27:29,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:27:29,598 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:27:28" (2/3) ... [2025-01-10 07:27:29,599 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dcdd91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:27:29, skipping insertion in model container [2025-01-10 07:27:29,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:27:29,599 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:27:29" (3/3) ... [2025-01-10 07:27:29,600 INFO L363 chiAutomizerObserver]: Analyzing ICFG psyco_abp_1-3.c [2025-01-10 07:27:29,649 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:27:29,649 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:27:29,649 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:27:29,649 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:27:29,649 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:27:29,650 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:27:29,651 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:27:29,651 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:27:29,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.9259259259259258) internal successors, (208), 108 states have internal predecessors, (208), 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:27:29,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2025-01-10 07:27:29,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:27:29,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:27:29,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:27:29,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:27:29,689 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:27:29,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.9259259259259258) internal successors, (208), 108 states have internal predecessors, (208), 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:27:29,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2025-01-10 07:27:29,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:27:29,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:27:29,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:27:29,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:27:29,704 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(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0;" [2025-01-10 07:27:29,705 INFO L754 eck$LassoCheckResult]: Loop: "goto;" "havoc main_#t~nondet4#1;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(0 == main_~q~0#1);" "assume !(1 == main_~q~0#1);" "assume !(2 == main_~q~0#1);" "assume !(3 == main_~q~0#1);" "assume !(4 == main_~q~0#1);" "assume !(5 == main_~q~0#1);havoc main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1;" [2025-01-10 07:27:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:27:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862335120] [2025-01-10 07:27:29,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:29,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:27:29,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:27:29,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:29,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:29,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:29,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:27:29,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:27:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:29,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1394962846, now seen corresponding path program 1 times [2025-01-10 07:27:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060438669] [2025-01-10 07:27:29,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:29,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:27:29,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:27:29,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:29,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:29,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:29,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:27:29,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:27:29,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:29,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:29,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:29,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash -704401372, now seen corresponding path program 1 times [2025-01-10 07:27:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:29,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980085175] [2025-01-10 07:27:29,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:29,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:27:29,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:27:29,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:29,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:27:29,911 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:27:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:27:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980085175] [2025-01-10 07:27:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980085175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:27:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:27:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:27:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594320108] [2025-01-10 07:27:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:27:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:27:30,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:27:30,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:27:30,038 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.9259259259259258) internal successors, (208), 108 states have internal predecessors, (208), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:27:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:27:30,100 INFO L93 Difference]: Finished difference Result 111 states and 201 transitions. [2025-01-10 07:27:30,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 201 transitions. [2025-01-10 07:27:30,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-01-10 07:27:30,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 80 states and 121 transitions. [2025-01-10 07:27:30,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2025-01-10 07:27:30,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-01-10 07:27:30,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 121 transitions. [2025-01-10 07:27:30,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:27:30,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-01-10 07:27:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 121 transitions. [2025-01-10 07:27:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 07:27:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.5125) internal successors, (121), 79 states have internal predecessors, (121), 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:27:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-01-10 07:27:30,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-01-10 07:27:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:27:30,145 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-01-10 07:27:30,145 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:27:30,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 121 transitions. [2025-01-10 07:27:30,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-01-10 07:27:30,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:27:30,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:27:30,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:27:30,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:27:30,153 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(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0;" "goto;" [2025-01-10 07:27:30,153 INFO L754 eck$LassoCheckResult]: Loop: "havoc main_#t~nondet4#1;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume 0 == main_~q~0#1;havoc main_#t~nondet13#1;" "assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1;" [2025-01-10 07:27:30,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:27:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427302725] [2025-01-10 07:27:30,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:30,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:30,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:30,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:30,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:30,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 36854, now seen corresponding path program 1 times [2025-01-10 07:27:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506812718] [2025-01-10 07:27:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:30,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:30,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:30,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:30,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:27:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 889536532, now seen corresponding path program 1 times [2025-01-10 07:27:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:27:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651270428] [2025-01-10 07:27:30,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:27:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:27:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:27:30,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:27:30,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:30,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:27:30,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:27:30,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:27:30,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:30,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:30,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,513 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:27:30,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:27:30,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:27:30,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:27:30,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:27:30,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:27:30 BoogieIcfgContainer [2025-01-10 07:27:30,564 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:27:30,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:27:30,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:27:30,565 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:27:30,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:27:29" (3/4) ... [2025-01-10 07:27:30,568 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:27:30,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:27:30,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:27:30,605 INFO L158 Benchmark]: Toolchain (without parser) took 2378.57ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 76.7MB in the end (delta: 44.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-01-10 07:27:30,605 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:30,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.69ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 101.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:27:30,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 98.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:27:30,606 INFO L158 Benchmark]: Boogie Preprocessor took 71.66ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 94.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:30,606 INFO L158 Benchmark]: RCFGBuilder took 904.25ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 51.7MB in the end (delta: 43.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 07:27:30,607 INFO L158 Benchmark]: BuchiAutomizer took 971.81ms. Allocated memory is still 167.8MB. Free memory was 51.7MB in the beginning and 80.1MB in the end (delta: -28.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:30,607 INFO L158 Benchmark]: Witness Printer took 39.38ms. Allocated memory is still 167.8MB. Free memory was 80.1MB in the beginning and 76.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:27:30,608 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.31ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.69ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 101.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 98.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.66ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 94.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 904.25ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 51.7MB in the end (delta: 43.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 971.81ms. Allocated memory is still 167.8MB. Free memory was 51.7MB in the beginning and 80.1MB in the end (delta: -28.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 39.38ms. Allocated memory is still 167.8MB. Free memory was 80.1MB in the beginning and 76.7MB in the end (delta: 3.4MB). 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 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 3 locations. The remainder module has 80 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 373 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 197 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 26]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] unsigned int this_expect = 0; [L23] unsigned int this_buffer_empty = 0; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] Loop: [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L41] COND TRUE q == 0 [L42] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 26]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] unsigned int this_expect = 0; [L23] unsigned int this_buffer_empty = 0; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] Loop: [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L41] COND TRUE q == 0 [L42] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:27:30,620 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)