./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/psyco/psyco_abp_1-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:58:19,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:58:19,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:58:19,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:58:19,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:58:19,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:58:19,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:58:19,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:58:19,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:58:19,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:58:19,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:58:19,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:58:19,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:58:19,581 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:58:19,581 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:58:19,581 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:58:19,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:58:19,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:58:19,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:58:19,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:58:19,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:58:19,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:58:19,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:58:19,584 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:58:19,584 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/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-03-04 15:58:19,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:58:19,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:58:19,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:58:19,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:58:19,819 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:58:19,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2025-03-04 15:58:20,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e3eaeaa/6ccedcdfe06846c5a0560df061486f89/FLAGa8e6932f9 [2025-03-04 15:58:21,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:58:21,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2025-03-04 15:58:21,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e3eaeaa/6ccedcdfe06846c5a0560df061486f89/FLAGa8e6932f9 [2025-03-04 15:58:21,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e3eaeaa/6ccedcdfe06846c5a0560df061486f89 [2025-03-04 15:58:21,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:58:21,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:58:21,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:58:21,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:58:21,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:58:21,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793c6fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21, skipping insertion in model container [2025-03-04 15:58:21,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:58:21,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:58:21,664 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:58:21,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:58:21,718 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:58:21,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21 WrapperNode [2025-03-04 15:58:21,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:58:21,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:58:21,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:58:21,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:58:21,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,770 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 414 [2025-03-04 15:58:21,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:58:21,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:58:21,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:58:21,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:58:21,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,805 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-03-04 15:58:21,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:58:21,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:58:21,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:58:21,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:58:21,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (1/1) ... [2025-03-04 15:58:21,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:58:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:58:21,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:58:21,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:58:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:58:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:58:21,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:58:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:58:21,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:58:21,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:58:22,458 INFO L? ?]: Removed 271 outVars from TransFormulas that were not future-live. [2025-03-04 15:58:22,460 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:58:22,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:58:22,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:58:22,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:22 BoogieIcfgContainer [2025-03-04 15:58:22,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:58:22,472 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:58:22,472 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:58:22,487 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:58:22,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:58:22,488 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:58:21" (1/3) ... [2025-03-04 15:58:22,489 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3808f8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:58:22, skipping insertion in model container [2025-03-04 15:58:22,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:58:22,489 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:21" (2/3) ... [2025-03-04 15:58:22,490 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3808f8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:58:22, skipping insertion in model container [2025-03-04 15:58:22,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:58:22,490 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:22" (3/3) ... [2025-03-04 15:58:22,491 INFO L363 chiAutomizerObserver]: Analyzing ICFG psyco_abp_1-3.c [2025-03-04 15:58:22,532 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:58:22,533 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:58:22,534 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:58:22,534 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:58:22,534 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:58:22,534 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:58:22,535 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:58:22,535 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:58:22,539 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-03-04 15:58:22,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2025-03-04 15:58:22,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:58:22,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:58:22,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:58:22,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:58:22,563 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:58:22,564 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-03-04 15:58:22,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2025-03-04 15:58:22,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:58:22,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:58:22,570 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:58:22,570 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:58:22,575 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-03-04 15:58:22,576 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-03-04 15:58:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 13408, now seen corresponding path program 1 times [2025-03-04 15:58:22,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:22,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493989315] [2025-03-04 15:58:22,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:22,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:58:22,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:58:22,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:22,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:58:22,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:58:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1749354593, now seen corresponding path program 1 times [2025-03-04 15:58:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19678527] [2025-03-04 15:58:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:22,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:58:22,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:58:22,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:22,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:58:22,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:58:22,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:22,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1412853184, now seen corresponding path program 1 times [2025-03-04 15:58:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7592434] [2025-03-04 15:58:22,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:22,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:58:22,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:58:22,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:58:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:58:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:58:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7592434] [2025-03-04 15:58:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7592434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:58:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:58:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:58:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775734849] [2025-03-04 15:58:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:58:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:58:22,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:58:22,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:58:22,819 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-03-04 15:58:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:58:22,863 INFO L93 Difference]: Finished difference Result 111 states and 201 transitions. [2025-03-04 15:58:22,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 201 transitions. [2025-03-04 15:58:22,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-03-04 15:58:22,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 80 states and 121 transitions. [2025-03-04 15:58:22,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2025-03-04 15:58:22,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-03-04 15:58:22,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 121 transitions. [2025-03-04 15:58:22,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:58:22,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-04 15:58:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 121 transitions. [2025-03-04 15:58:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 15:58:22,896 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-03-04 15:58:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-04 15:58:22,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-04 15:58:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:58:22,901 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-04 15:58:22,901 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:58:22,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 121 transitions. [2025-03-04 15:58:22,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2025-03-04 15:58:22,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:58:22,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:58:22,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:58:22,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:58:22,902 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;" "assume true;" [2025-03-04 15:58:22,902 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-03-04 15:58:22,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 416034, now seen corresponding path program 1 times [2025-03-04 15:58:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121335798] [2025-03-04 15:58:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:22,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:22,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:22,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:22,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:22,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:22,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:22,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash 412031, now seen corresponding path program 1 times [2025-03-04 15:58:22,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:22,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124716290] [2025-03-04 15:58:22,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:22,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:22,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:22,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:22,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:22,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:22,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:22,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash -490450754, now seen corresponding path program 1 times [2025-03-04 15:58:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681214743] [2025-03-04 15:58:22,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:22,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:58:22,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:58:22,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:22,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:58:22,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:58:22,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:22,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:22,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:23,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:58:23 BoogieIcfgContainer [2025-03-04 15:58:23,173 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:58:23,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:58:23,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:58:23,174 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:58:23,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:22" (3/4) ... [2025-03-04 15:58:23,175 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:58:23,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:58:23,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:58:23,202 INFO L158 Benchmark]: Toolchain (without parser) took 1715.10ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 50.6MB in the end (delta: 61.3MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,202 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:58:23,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.91ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 93.0MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.70ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,203 INFO L158 Benchmark]: Boogie Preprocessor took 49.17ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:58:23,203 INFO L158 Benchmark]: IcfgBuilder took 646.59ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 40.7MB in the end (delta: 45.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,203 INFO L158 Benchmark]: BuchiAutomizer took 701.17ms. Allocated memory is still 142.6MB. Free memory was 40.7MB in the beginning and 54.2MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:58:23,203 INFO L158 Benchmark]: Witness Printer took 27.99ms. Allocated memory is still 142.6MB. Free memory was 54.2MB in the beginning and 50.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,204 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 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.91ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 93.0MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.70ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.17ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 646.59ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 40.7MB in the end (delta: 45.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 701.17ms. Allocated memory is still 142.6MB. Free memory was 40.7MB in the beginning and 54.2MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 27.99ms. Allocated memory is still 142.6MB. Free memory was 54.2MB in the beginning and 50.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. 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.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 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] [L26] COND TRUE 1 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] [L26] COND TRUE 1 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-03-04 15:58:23,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)