/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/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:12,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:12,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:12,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:12,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:12,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:12,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:12,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:12,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:12,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:12,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:12,729 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:12,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:12,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:12,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:12,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:12,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:12,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:12,731 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:12,731 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:12,731 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:12,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:12,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:12,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:12,942 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:12,943 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:12,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2025-04-26 16:53:12,946 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl' [2025-04-26 16:53:12,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:12,959 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:12,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:12,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:12,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:12,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:12,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:12,990 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:12,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:12,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:12,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:12,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:12,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:12,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:12,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:12,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:13,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:13,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:13,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:13,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/1) ... [2025-04-26 16:53:13,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:13,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,043 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:53:13,046 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:53:13,065 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 16:53:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 16:53:13,065 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 16:53:13,065 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:13,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:13,066 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 16:53:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 16:53:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 16:53:13,066 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 16:53:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 16:53:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 16:53:13,066 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:53:13,096 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:13,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:13,165 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:13,166 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:13,175 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:13,175 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:13,176 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:13 BoogieIcfgContainer [2025-04-26 16:53:13,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:13,176 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:13,176 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:13,180 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:13,180 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:13,180 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:12" (1/2) ... [2025-04-26 16:53:13,181 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78be022f and model type Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:13, skipping insertion in model container [2025-04-26 16:53:13,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:13,181 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:13" (2/2) ... [2025-04-26 16:53:13,182 INFO L376 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2025-04-26 16:53:13,216 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-26 16:53:13,256 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:13,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:13,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,259 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:53:13,261 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:53:13,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 107 flow [2025-04-26 16:53:13,336 INFO L116 PetriNetUnfolderBase]: 8/31 cut-off events. [2025-04-26 16:53:13,337 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-26 16:53:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 31 events. 8/31 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 6 conditions per place. [2025-04-26 16:53:13,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 107 flow [2025-04-26 16:53:13,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 92 flow [2025-04-26 16:53:13,348 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 28 transitions, 92 flow [2025-04-26 16:53:13,354 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:13,491 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 351#[L11, L22, L29, L38]true [2025-04-26 16:53:13,492 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 297#[L11, L30, L37, L21]true [2025-04-26 16:53:13,494 WARN L140 AmpleReduction]: Number of pruned transitions: 150 [2025-04-26 16:53:13,495 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 2 [2025-04-26 16:53:13,495 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 33 [2025-04-26 16:53:13,495 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:40 [2025-04-26 16:53:13,495 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:87 [2025-04-26 16:53:13,495 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 16:53:13,495 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:12 [2025-04-26 16:53:13,495 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:13,500 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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:53:13,504 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:13,505 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:13,505 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:13,505 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:13,505 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:13,505 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:13,505 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:13,505 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:13,507 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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:53:13,521 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 103 [2025-04-26 16:53:13,521 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:13,521 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:13,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:13,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:13,525 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:13,526 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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:53:13,531 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 103 [2025-04-26 16:53:13,531 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:13,531 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:13,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:13,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:13,538 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" [2025-04-26 16:53:13,538 INFO L754 eck$LassoCheckResult]: Loop: "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:13,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 75212, now seen corresponding path program 1 times [2025-04-26 16:53:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:13,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227559567] [2025-04-26 16:53:13,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:13,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:13,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:13,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:13,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:13,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:13,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:13,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:13,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:13,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:13,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:13,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2025-04-26 16:53:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:13,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95365667] [2025-04-26 16:53:13,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:13,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:13,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:13,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:13,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:13,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:13,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:13,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:13,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:13,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:13,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2054272917, now seen corresponding path program 1 times [2025-04-26 16:53:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:13,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462031468] [2025-04-26 16:53:13,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:13,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:13,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:13,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:13,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:13,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:13,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:13,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:13,755 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:13,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:13,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:13,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:13,757 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:13,757 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:13,757 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:13,757 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:13,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:13,758 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:13,758 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:13,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:13,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:13,841 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:13,841 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:13,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:13,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:13,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:13,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:13,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:13,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:13,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:13,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:13,891 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:13,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:53:13,895 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:13,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:13,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:13,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:13,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:13,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:13,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:13,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:13,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:13,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:13,896 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:13,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:13,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:13,951 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:13,954 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:13,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:13,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:13,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:13,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:13,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:13,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:13,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:13,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:13,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:13,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:13,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:13,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:13,984 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:13,984 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:13,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:14,005 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:14,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:14,008 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:14,009 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:14,009 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 7 Supporting invariants [] [2025-04-26 16:53:14,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:14,017 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:14,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:14,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:14,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:14,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:14,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,082 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:53:14,096 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:14,098 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:53:14,224 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 159 states, 158 states have (on average 1.9367088607594938) internal successors, (in total 306), 158 states have internal predecessors, (306), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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) Result 545 states and 1123 transitions. Complement of second has 7 states. [2025-04-26 16:53:14,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:53:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:53:14,230 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:53:14,231 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,231 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:53:14,231 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,231 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:53:14,231 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 545 states and 1123 transitions. [2025-04-26 16:53:14,241 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 149 [2025-04-26 16:53:14,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 545 states to 355 states and 772 transitions. [2025-04-26 16:53:14,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2025-04-26 16:53:14,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2025-04-26 16:53:14,248 INFO L74 IsDeterministic]: Start isDeterministic. Operand 355 states and 772 transitions. [2025-04-26 16:53:14,248 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:14,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 355 states and 772 transitions. [2025-04-26 16:53:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 772 transitions. [2025-04-26 16:53:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 241. [2025-04-26 16:53:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 241 states have (on average 2.1493775933609958) internal successors, (in total 518), 240 states have internal predecessors, (518), 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:53:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 518 transitions. [2025-04-26 16:53:14,283 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 518 transitions. [2025-04-26 16:53:14,284 INFO L438 stractBuchiCegarLoop]: Abstraction has 241 states and 518 transitions. [2025-04-26 16:53:14,284 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:14,284 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 518 transitions. [2025-04-26 16:53:14,286 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 111 [2025-04-26 16:53:14,286 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:14,286 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:14,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:14,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:14,287 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" [2025-04-26 16:53:14,289 INFO L754 eck$LassoCheckResult]: Loop: "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:14,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2331643, now seen corresponding path program 1 times [2025-04-26 16:53:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991555881] [2025-04-26 16:53:14,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:14,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:14,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:14,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:14,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:14,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:14,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:53:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947742081] [2025-04-26 16:53:14,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:14,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:14,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2054256483, now seen corresponding path program 1 times [2025-04-26 16:53:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986814366] [2025-04-26 16:53:14,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:14,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,328 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:53:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:14,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986814366] [2025-04-26 16:53:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986814366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:14,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:53:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500352483] [2025-04-26 16:53:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:14,343 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:14,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:14,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:14,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:14,343 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:14,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:14,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:14,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:14,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:14,343 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:14,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:14,360 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:14,360 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:14,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:14,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:14,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,383 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:14,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:14,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:14,398 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:14,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:14,404 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:14,404 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:14,404 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:14,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:14,404 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:14,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:14,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:14,404 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:14,404 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:14,404 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:14,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:14,422 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:14,422 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:14,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:14,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:14,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:14,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:14,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:14,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:14,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:14,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:14,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:14,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:14,440 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:53:14,440 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:14,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,442 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:14,444 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:14,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:14,447 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:14,447 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:14,447 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:53:14,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:53:14,453 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:14,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:14,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:14,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,494 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:53:14,495 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:14,495 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 518 transitions. cyclomatic complexity: 326 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:53:14,549 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241 states and 518 transitions. cyclomatic complexity: 326. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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) Result 880 states and 1979 transitions. Complement of second has 7 states. [2025-04-26 16:53:14,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:53:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:53:14,550 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:53:14,550 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,550 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:53:14,550 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,550 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:53:14,550 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 880 states and 1979 transitions. [2025-04-26 16:53:14,557 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 141 [2025-04-26 16:53:14,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 880 states to 655 states and 1510 transitions. [2025-04-26 16:53:14,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2025-04-26 16:53:14,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2025-04-26 16:53:14,563 INFO L74 IsDeterministic]: Start isDeterministic. Operand 655 states and 1510 transitions. [2025-04-26 16:53:14,563 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:14,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 655 states and 1510 transitions. [2025-04-26 16:53:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 1510 transitions. [2025-04-26 16:53:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 458. [2025-04-26 16:53:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 458 states have (on average 2.534934497816594) internal successors, (in total 1161), 457 states have internal predecessors, (1161), 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:53:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1161 transitions. [2025-04-26 16:53:14,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 458 states and 1161 transitions. [2025-04-26 16:53:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:14,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:14,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:14,586 INFO L87 Difference]: Start difference. First operand 458 states and 1161 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 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:53:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:14,622 INFO L93 Difference]: Finished difference Result 604 states and 1366 transitions. [2025-04-26 16:53:14,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1366 transitions. [2025-04-26 16:53:14,626 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 96 [2025-04-26 16:53:14,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 464 states and 1067 transitions. [2025-04-26 16:53:14,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2025-04-26 16:53:14,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 327 [2025-04-26 16:53:14,630 INFO L74 IsDeterministic]: Start isDeterministic. Operand 464 states and 1067 transitions. [2025-04-26 16:53:14,630 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:14,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 464 states and 1067 transitions. [2025-04-26 16:53:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 1067 transitions. [2025-04-26 16:53:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 301. [2025-04-26 16:53:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 301 states have (on average 2.4385382059800667) internal successors, (in total 734), 300 states have internal predecessors, (734), 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:53:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 734 transitions. [2025-04-26 16:53:14,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 301 states and 734 transitions. [2025-04-26 16:53:14,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:14,645 INFO L438 stractBuchiCegarLoop]: Abstraction has 301 states and 734 transitions. [2025-04-26 16:53:14,645 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:14,645 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 734 transitions. [2025-04-26 16:53:14,646 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 70 [2025-04-26 16:53:14,647 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:14,647 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:14,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:14,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:14,647 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[53] L20-->oneFINAL: Formula: (or (<= 4 v_n_4) (not (= v_x_3 1))) InVars {x=v_x_3, n=v_n_4} OutVars{x=v_x_3, n=v_n_4} AuxVars[] AssignedVars[]" "[58] L29-->twoFINAL: Formula: (not (= 2 v_x_7)) InVars {x=v_x_7} OutVars{x=v_x_7} AuxVars[] AssignedVars[]" [2025-04-26 16:53:14,647 INFO L754 eck$LassoCheckResult]: Loop: "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:14,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 742572692, now seen corresponding path program 1 times [2025-04-26 16:53:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264535109] [2025-04-26 16:53:14,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:14,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:14,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,687 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:53:14,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:14,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264535109] [2025-04-26 16:53:14,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264535109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:14,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:14,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597487810] [2025-04-26 16:53:14,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:14,688 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:14,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 16:53:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754665448] [2025-04-26 16:53:14,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:14,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:14,711 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:14,711 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:14,711 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:14,711 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:14,711 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:14,711 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,711 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:14,711 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:14,711 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:14,711 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:14,711 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:14,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:14,727 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:14,727 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,729 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:14,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:14,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:14,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:14,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:14,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:14,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:14,773 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:14,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:14,779 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:14,779 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:14,779 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:14,779 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:14,780 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:14,780 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,780 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:14,780 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:14,780 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:14,780 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:14,780 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:14,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:14,796 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:14,797 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:14,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:14,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:14,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:14,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:14,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:14,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:14,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:14,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:14,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:14,818 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:14,818 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:53:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,820 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:14,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:14,822 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:14,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:53:14,826 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:14,826 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:14,826 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2025-04-26 16:53:14,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:53:14,832 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:14,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:14,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:14,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,887 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:53:14,887 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:14,887 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 301 states and 734 transitions. cyclomatic complexity: 465 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:53:14,938 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 301 states and 734 transitions. cyclomatic complexity: 465. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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) Result 514 states and 1076 transitions. Complement of second has 9 states. [2025-04-26 16:53:14,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:53:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-04-26 16:53:14,939 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:53:14,939 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,939 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:53:14,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:53:14,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 1076 transitions. [2025-04-26 16:53:14,944 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 73 [2025-04-26 16:53:14,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 394 states and 865 transitions. [2025-04-26 16:53:14,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2025-04-26 16:53:14,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 16:53:14,947 INFO L74 IsDeterministic]: Start isDeterministic. Operand 394 states and 865 transitions. [2025-04-26 16:53:14,947 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:14,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 394 states and 865 transitions. [2025-04-26 16:53:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states and 865 transitions. [2025-04-26 16:53:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 344. [2025-04-26 16:53:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 344 states have (on average 2.2994186046511627) internal successors, (in total 791), 343 states have internal predecessors, (791), 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:53:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 791 transitions. [2025-04-26 16:53:14,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 344 states and 791 transitions. [2025-04-26 16:53:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:14,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:14,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:14,956 INFO L87 Difference]: Start difference. First operand 344 states and 791 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:53:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:15,013 INFO L93 Difference]: Finished difference Result 498 states and 1026 transitions. [2025-04-26 16:53:15,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 1026 transitions. [2025-04-26 16:53:15,017 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 75 [2025-04-26 16:53:15,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 455 states and 919 transitions. [2025-04-26 16:53:15,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2025-04-26 16:53:15,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 16:53:15,019 INFO L74 IsDeterministic]: Start isDeterministic. Operand 455 states and 919 transitions. [2025-04-26 16:53:15,020 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 455 states and 919 transitions. [2025-04-26 16:53:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 919 transitions. [2025-04-26 16:53:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 390. [2025-04-26 16:53:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 390 states have (on average 2.117948717948718) internal successors, (in total 826), 389 states have internal predecessors, (826), 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:53:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 826 transitions. [2025-04-26 16:53:15,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 390 states and 826 transitions. [2025-04-26 16:53:15,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:15,031 INFO L438 stractBuchiCegarLoop]: Abstraction has 390 states and 826 transitions. [2025-04-26 16:53:15,032 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:15,032 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 826 transitions. [2025-04-26 16:53:15,033 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 74 [2025-04-26 16:53:15,033 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,033 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:15,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,034 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,034 INFO L754 eck$LassoCheckResult]: Loop: "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 158426513, now seen corresponding path program 1 times [2025-04-26 16:53:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754935639] [2025-04-26 16:53:15,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:15,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:15,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,057 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:53:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754935639] [2025-04-26 16:53:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754935639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012588177] [2025-04-26 16:53:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,057 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:15,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 2 times [2025-04-26 16:53:15,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110211222] [2025-04-26 16:53:15,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:15,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,073 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,073 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 16:53:15,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,074 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,088 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,090 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:15,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:15,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,117 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:15,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,130 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:53:15,136 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,136 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,136 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,136 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,136 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,136 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,136 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,136 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 16:53:15,136 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,136 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,151 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,151 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,153 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:53:15,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:15,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,170 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,170 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:53:15,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,202 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:15,203 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:53:15,206 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,206 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,206 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2025-04-26 16:53:15,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:53:15,211 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:15,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,247 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:53:15,247 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:53:15,247 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 390 states and 826 transitions. cyclomatic complexity: 471 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:53:15,298 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 390 states and 826 transitions. cyclomatic complexity: 471. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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) Result 806 states and 1721 transitions. Complement of second has 9 states. [2025-04-26 16:53:15,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:53:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-26 16:53:15,299 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:53:15,299 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,299 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:53:15,299 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,299 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:53:15,299 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 806 states and 1721 transitions. [2025-04-26 16:53:15,303 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 84 [2025-04-26 16:53:15,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 806 states to 625 states and 1340 transitions. [2025-04-26 16:53:15,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2025-04-26 16:53:15,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2025-04-26 16:53:15,307 INFO L74 IsDeterministic]: Start isDeterministic. Operand 625 states and 1340 transitions. [2025-04-26 16:53:15,307 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 625 states and 1340 transitions. [2025-04-26 16:53:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states and 1340 transitions. [2025-04-26 16:53:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 463. [2025-04-26 16:53:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 2.2159827213822894) internal successors, (in total 1026), 462 states have internal predecessors, (1026), 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:53:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1026 transitions. [2025-04-26 16:53:15,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 463 states and 1026 transitions. [2025-04-26 16:53:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:15,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:15,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:15,316 INFO L87 Difference]: Start difference. First operand 463 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:53:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:15,337 INFO L93 Difference]: Finished difference Result 544 states and 1025 transitions. [2025-04-26 16:53:15,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 544 states and 1025 transitions. [2025-04-26 16:53:15,340 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 58 [2025-04-26 16:53:15,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 544 states to 439 states and 863 transitions. [2025-04-26 16:53:15,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2025-04-26 16:53:15,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2025-04-26 16:53:15,342 INFO L74 IsDeterministic]: Start isDeterministic. Operand 439 states and 863 transitions. [2025-04-26 16:53:15,342 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 439 states and 863 transitions. [2025-04-26 16:53:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states and 863 transitions. [2025-04-26 16:53:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 265. [2025-04-26 16:53:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 265 states have (on average 2.0528301886792453) internal successors, (in total 544), 264 states have internal predecessors, (544), 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:53:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 544 transitions. [2025-04-26 16:53:15,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 265 states and 544 transitions. [2025-04-26 16:53:15,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:15,348 INFO L438 stractBuchiCegarLoop]: Abstraction has 265 states and 544 transitions. [2025-04-26 16:53:15,348 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:15,348 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 544 transitions. [2025-04-26 16:53:15,349 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 57 [2025-04-26 16:53:15,349 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,349 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:15,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:15,350 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,350 INFO L754 eck$LassoCheckResult]: Loop: "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash 615758734, now seen corresponding path program 1 times [2025-04-26 16:53:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351103031] [2025-04-26 16:53:15,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,385 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:53:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351103031] [2025-04-26 16:53:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351103031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:53:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548469478] [2025-04-26 16:53:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,386 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:15,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 80224376, now seen corresponding path program 1 times [2025-04-26 16:53:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832770986] [2025-04-26 16:53:15,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:15,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:15,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:15,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,421 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,421 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,421 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,421 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration5_Loop [2025-04-26 16:53:15,421 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,421 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,458 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,459 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,460 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:15,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,481 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:53:15,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,483 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,494 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,499 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,499 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_petrified1_Iteration5_Loop [2025-04-26 16:53:15,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,500 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,529 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,529 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,531 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:53:15,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:15,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,549 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,549 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,551 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:53:15,554 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:53:15,557 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,557 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,557 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 16:53:15,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,562 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:15,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:15,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:15,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,625 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:53:15,626 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:15,626 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 265 states and 544 transitions. cyclomatic complexity: 296 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 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:53:15,663 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 265 states and 544 transitions. cyclomatic complexity: 296. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 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) Result 510 states and 1025 transitions. Complement of second has 7 states. [2025-04-26 16:53:15,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 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:53:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:53:15,664 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:53:15,664 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,664 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 16:53:15,665 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,665 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 10 letters. Loop has 10 letters. [2025-04-26 16:53:15,665 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 510 states and 1025 transitions. [2025-04-26 16:53:15,667 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 57 [2025-04-26 16:53:15,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 510 states to 291 states and 611 transitions. [2025-04-26 16:53:15,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2025-04-26 16:53:15,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2025-04-26 16:53:15,669 INFO L74 IsDeterministic]: Start isDeterministic. Operand 291 states and 611 transitions. [2025-04-26 16:53:15,669 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 611 transitions. [2025-04-26 16:53:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 611 transitions. [2025-04-26 16:53:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 264. [2025-04-26 16:53:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 264 states have (on average 2.132575757575758) internal successors, (in total 563), 263 states have internal predecessors, (563), 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:53:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 563 transitions. [2025-04-26 16:53:15,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 264 states and 563 transitions. [2025-04-26 16:53:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:15,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:15,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:15,695 INFO L87 Difference]: Start difference. First operand 264 states and 563 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 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:53:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:15,724 INFO L93 Difference]: Finished difference Result 451 states and 861 transitions. [2025-04-26 16:53:15,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 861 transitions. [2025-04-26 16:53:15,726 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 67 [2025-04-26 16:53:15,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 424 states and 803 transitions. [2025-04-26 16:53:15,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2025-04-26 16:53:15,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-04-26 16:53:15,728 INFO L74 IsDeterministic]: Start isDeterministic. Operand 424 states and 803 transitions. [2025-04-26 16:53:15,728 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 424 states and 803 transitions. [2025-04-26 16:53:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states and 803 transitions. [2025-04-26 16:53:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 307. [2025-04-26 16:53:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 307 states have (on average 2.1270358306188926) internal successors, (in total 653), 306 states have internal predecessors, (653), 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:53:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 653 transitions. [2025-04-26 16:53:15,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 307 states and 653 transitions. [2025-04-26 16:53:15,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:15,735 INFO L438 stractBuchiCegarLoop]: Abstraction has 307 states and 653 transitions. [2025-04-26 16:53:15,735 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:15,735 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 653 transitions. [2025-04-26 16:53:15,736 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 67 [2025-04-26 16:53:15,736 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,736 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:15,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-04-26 16:53:15,738 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,739 INFO L754 eck$LassoCheckResult]: Loop: "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" [2025-04-26 16:53:15,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1208839719, now seen corresponding path program 2 times [2025-04-26 16:53:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497466175] [2025-04-26 16:53:15,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:53:15,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 14 statements. [2025-04-26 16:53:15,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:15,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:53:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497466175] [2025-04-26 16:53:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497466175] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679995321] [2025-04-26 16:53:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,765 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:15,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1948198079, now seen corresponding path program 2 times [2025-04-26 16:53:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213202386] [2025-04-26 16:53:15,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:53:15,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 8 statements. [2025-04-26 16:53:15,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:15,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:53:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213202386] [2025-04-26 16:53:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213202386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:53:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572025268] [2025-04-26 16:53:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,780 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:53:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:15,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:15,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:15,780 INFO L87 Difference]: Start difference. First operand 307 states and 653 transitions. cyclomatic complexity: 362 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:53:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:15,797 INFO L93 Difference]: Finished difference Result 255 states and 427 transitions. [2025-04-26 16:53:15,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 427 transitions. [2025-04-26 16:53:15,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2025-04-26 16:53:15,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 156 states and 275 transitions. [2025-04-26 16:53:15,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2025-04-26 16:53:15,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 16:53:15,799 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156 states and 275 transitions. [2025-04-26 16:53:15,799 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 275 transitions. [2025-04-26 16:53:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 275 transitions. [2025-04-26 16:53:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2025-04-26 16:53:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.8135593220338984) internal successors, (in total 214), 117 states have internal predecessors, (214), 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:53:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 214 transitions. [2025-04-26 16:53:15,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 214 transitions. [2025-04-26 16:53:15,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:15,802 INFO L438 stractBuchiCegarLoop]: Abstraction has 118 states and 214 transitions. [2025-04-26 16:53:15,802 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:53:15,802 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 214 transitions. [2025-04-26 16:53:15,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2025-04-26 16:53:15,803 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,803 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:15,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2025-04-26 16:53:15,804 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L7: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[37] L7-->L9: Formula: (= v_n_5 1) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,805 INFO L754 eck$LassoCheckResult]: Loop: "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[59] L29-->L30: Formula: (= 2 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[61] L30-->L29: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[54] L20-->L21: Formula: (and (< v_n_1 4) (= v_x_1 1)) InVars {x=v_x_1, n=v_n_1} OutVars{x=v_x_1, n=v_n_1} AuxVars[] AssignedVars[]" "[56] L21-->L22: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n]" "[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[]" "[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n]" [2025-04-26 16:53:15,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 140526987, now seen corresponding path program 1 times [2025-04-26 16:53:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105728820] [2025-04-26 16:53:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:15,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:15,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:15,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:15,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -490312829, now seen corresponding path program 1 times [2025-04-26 16:53:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620979210] [2025-04-26 16:53:15,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:15,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:15,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:15,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:15,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1049145869, now seen corresponding path program 2 times [2025-04-26 16:53:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834111390] [2025-04-26 16:53:15,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:53:15,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:15,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:15,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:15,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:15,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:15,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:15,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:15,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,962 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:15 BoogieIcfgContainer [2025-04-26 16:53:15,962 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:15,963 INFO L158 Benchmark]: Toolchain (without parser) took 3003.71ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.1MB in the beginning and 86.5MB in the end (delta: -410.5kB). Peak memory consumption was 202.8kB. Max. memory is 8.0GB. [2025-04-26 16:53:15,963 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.67ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:15,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.02ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:15,963 INFO L158 Benchmark]: Boogie Preprocessor took 24.32ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.2MB in the end (delta: 905.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:15,963 INFO L158 Benchmark]: RCFGBuilder took 158.17ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.4MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:53:15,964 INFO L158 Benchmark]: BuchiAutomizer took 2786.01ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.3MB in the beginning and 86.5MB in the end (delta: -12.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:15,967 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.67ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.02ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.32ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.2MB in the end (delta: 905.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 158.17ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.4MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2786.01ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.3MB in the beginning and 86.5MB in the end (delta: -12.2MB). 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 2.6s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 1.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1107 StatesRemovedByMinimization, 10 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 182 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI1 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 243, Number of transitions in reduction automaton: 306, Number of states in reduction automaton: 159, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * n and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 118 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=1, x=1] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L21] 1 x := 2; VAL [n=1, x=2] [L22] 1 n := n + 1; VAL [n=2, x=2] [L11] FORK 0 fork 3 three(); VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 VAL [n=2, x=2] [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=2, x=1] [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=1, x=1] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L21] 1 x := 2; VAL [n=1, x=2] [L22] 1 n := n + 1; VAL [n=2, x=2] [L11] FORK 0 fork 3 three(); VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 VAL [n=2, x=2] [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 VAL [n=2, x=1] [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:53:15,981 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...