/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:08,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:08,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:08,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:08,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:08,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:08,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:08,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:08,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:08,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:08,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:08,809 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:08,809 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:08,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:08,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:08,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:08,812 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:08,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:08,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:08,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:08,813 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:08,813 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:09,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:09,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:09,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:09,024 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:09,025 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:09,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3.wvr.bpl [2025-04-26 16:55:09,026 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3.wvr.bpl' [2025-04-26 16:55:09,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:09,045 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:09,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:09,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:09,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:09,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,079 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:09,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:09,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:09,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:09,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:09,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:09,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:09,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:09,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:09,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/1) ... [2025-04-26 16:55:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:09,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:55:09,149 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:09,149 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:09,149 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:09,150 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:55:09,185 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:09,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:09,265 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:09,265 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:09,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:09,271 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:09,272 INFO L201 PluginConnector]: Adding new model misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:09 BoogieIcfgContainer [2025-04-26 16:55:09,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:09,273 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:09,273 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:09,276 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:09,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:09,277 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:09" (1/2) ... [2025-04-26 16:55:09,278 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c6651a7 and model type misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:09, skipping insertion in model container [2025-04-26 16:55:09,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:09,278 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:09" (2/2) ... [2025-04-26 16:55:09,279 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-3.wvr.bpl [2025-04-26 16:55:09,315 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:55:09,349 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:09,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:09,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:09,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:09,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:55:09,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 88 flow [2025-04-26 16:55:09,413 INFO L116 PetriNetUnfolderBase]: 8/33 cut-off events. [2025-04-26 16:55:09,414 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:55:09,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 8/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2025-04-26 16:55:09,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 88 flow [2025-04-26 16:55:09,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 78 flow [2025-04-26 16:55:09,424 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 33 transitions, 78 flow [2025-04-26 16:55:09,429 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:09,518 WARN L140 AmpleReduction]: Number of pruned transitions: 90 [2025-04-26 16:55:09,518 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:09,518 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13 [2025-04-26 16:55:09,518 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:25 [2025-04-26 16:55:09,518 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:67 [2025-04-26 16:55:09,519 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 16:55:09,519 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:52 [2025-04-26 16:55:09,519 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:09,520 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:09,525 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:09,525 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:09,525 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:09,525 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:09,525 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:09,525 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:09,526 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:09,526 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:09,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:09,536 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 91 [2025-04-26 16:55:09,536 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,536 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:09,540 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:09,540 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:09,543 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 91 [2025-04-26 16:55:09,543 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,543 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:09,547 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L67: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0))) InVars {pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} OutVars{pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} AuxVars[] AssignedVars[]" "[118] L67-->L28-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:09,547 INFO L754 eck$LassoCheckResult]: Loop: "[93] L28-1-->L19: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[96] L19-->L24: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[98] L24-->L19-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[99] L19-2-->L28: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[101] L28-->L28-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" [2025-04-26 16:55:09,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 3714, now seen corresponding path program 1 times [2025-04-26 16:55:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054971302] [2025-04-26 16:55:09,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash 117473888, now seen corresponding path program 1 times [2025-04-26 16:55:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412390642] [2025-04-26 16:55:09,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:09,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:09,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412390642] [2025-04-26 16:55:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412390642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:09,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179168968] [2025-04-26 16:55:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:09,688 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:55:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:09,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:55:09,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:55:09,713 INFO L87 Difference]: Start difference. First operand has 106 states, 104 states have (on average 1.6826923076923077) internal successors, (in total 175), 105 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:09,820 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2025-04-26 16:55:09,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 258 transitions. [2025-04-26 16:55:09,828 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 152 [2025-04-26 16:55:09,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 158 states and 232 transitions. [2025-04-26 16:55:09,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2025-04-26 16:55:09,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2025-04-26 16:55:09,871 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 232 transitions. [2025-04-26 16:55:09,872 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:09,872 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 232 transitions. [2025-04-26 16:55:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 232 transitions. [2025-04-26 16:55:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2025-04-26 16:55:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 1.4666666666666666) internal successors, (in total 198), 134 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-04-26 16:55:09,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-04-26 16:55:09,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:09,922 INFO L438 stractBuchiCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-04-26 16:55:09,922 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:09,922 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 198 transitions. [2025-04-26 16:55:09,926 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 131 [2025-04-26 16:55:09,926 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:09,926 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:09,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:09,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:09,928 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L67: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0))) InVars {pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} OutVars{pos=v_pos_9, d2=v_d2_7, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4} AuxVars[] AssignedVars[]" "[118] L67-->L28-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:09,929 INFO L754 eck$LassoCheckResult]: Loop: "[93] L28-1-->L19: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[95] L19-->L20: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[97] L20-->L19-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[99] L19-2-->L28: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[101] L28-->L28-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[93] L28-1-->L19: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[96] L19-->L24: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[98] L24-->L19-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[99] L19-2-->L28: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[100] L28-->L29: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[102] L29-->L28-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:55:09,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash 3714, now seen corresponding path program 2 times [2025-04-26 16:55:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40670850] [2025-04-26 16:55:09,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:09,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:09,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:09,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1559697178, now seen corresponding path program 1 times [2025-04-26 16:55:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056688634] [2025-04-26 16:55:09,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:09,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:09,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:09,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:09,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:09,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 983068613, now seen corresponding path program 1 times [2025-04-26 16:55:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:09,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252858109] [2025-04-26 16:55:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:09,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:09,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:09,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:09,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:09,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:09,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:55:10,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:55:10,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:10,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:10,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:10,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:10,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:10,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:10,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:10,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:55:10,185 INFO L201 PluginConnector]: Adding new model misc-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:10 BoogieIcfgContainer [2025-04-26 16:55:10,185 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:10,186 INFO L158 Benchmark]: Toolchain (without parser) took 1141.03ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 84.8MB in the beginning and 76.5MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:10,186 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:10,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.1MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:10,186 INFO L158 Benchmark]: Boogie Preprocessor took 16.97ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 983.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:10,187 INFO L158 Benchmark]: RCFGBuilder took 173.18ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 72.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:10,187 INFO L158 Benchmark]: BuchiAutomizer took 912.66ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 72.7MB in the beginning and 76.5MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:10,188 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.1MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.97ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 983.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 173.18ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 72.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 912.66ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 72.7MB in the beginning and 76.5MB in the end (delta: -3.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.8s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 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, 47 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 39 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 174, Number of transitions in reduction automaton: 175, Number of states in reduction automaton: 106, Underlying: - 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 4 locations. The remainder module has 135 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L66] 0 assume pos == 0 && d1 == d2 && d1 == g1 && d1 == g2 && d1 == true; VAL [d1=true, d2=true, g1=true, g2=true, pos=0] [L67] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, g1=true, g2=true, pos=0] Loop: [L18] COND TRUE g1 [L19] COND TRUE d1 [L20] pos := pos + 1; [L27] d1 := !d1; [L28] COND FALSE !(d1) [L18] COND TRUE g1 [L19] COND FALSE !(d1) [L24] pos := pos - 1; [L27] d1 := !d1; [L28] COND TRUE d1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L66] 0 assume pos == 0 && d1 == d2 && d1 == g1 && d1 == g2 && d1 == true; VAL [d1=true, d2=true, g1=true, g2=true, pos=0] [L67] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, g1=true, g2=true, pos=0] Loop: [L18] COND TRUE g1 [L19] COND TRUE d1 [L20] pos := pos + 1; [L27] d1 := !d1; [L28] COND FALSE !(d1) [L18] COND TRUE g1 [L19] COND FALSE !(d1) [L24] pos := pos - 1; [L27] d1 := !d1; [L28] COND TRUE d1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:55:10,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...