/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_FourLoopsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:47,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:47,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:47,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:47,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:47,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:47,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:47,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:47,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:47,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:47,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:47,316 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:47,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:47,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:47,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:47,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:47,317 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:47,318 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:47,318 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:47,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:47,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:47,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:47,540 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:47,541 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:47,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_FourLoopsAlternating_nonterminating.bpl [2025-04-26 18:38:47,544 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_FourLoopsAlternating_nonterminating.bpl' [2025-04-26 18:38:47,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:47,558 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:47,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:47,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:47,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:47,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,594 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:47,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:47,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:47,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:47,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:47,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:47,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:47,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:47,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:47,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/1) ... [2025-04-26 18:38:47,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:47,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:47,648 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 18:38:47,651 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 18:38:47,670 INFO L124 BoogieDeclarations]: Specification and implementation of procedure four given in one single declaration [2025-04-26 18:38:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure four [2025-04-26 18:38:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure four [2025-04-26 18:38:47,671 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 18:38:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 18:38:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 18:38:47,671 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:47,671 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 18:38:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 18:38:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 18:38:47,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 18:38:47,672 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 18:38:47,672 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 18:38:47,673 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 18:38:47,704 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:47,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:47,779 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:47,779 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:47,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:47,791 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:47,792 INFO L201 PluginConnector]: Adding new model Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:47 BoogieIcfgContainer [2025-04-26 18:38:47,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:47,793 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:47,794 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:47,798 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:47,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:47,799 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:47" (1/2) ... [2025-04-26 18:38:47,800 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@95d3527 and model type Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:47, skipping insertion in model container [2025-04-26 18:38:47,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:47,800 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:47" (2/2) ... [2025-04-26 18:38:47,801 INFO L376 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_FourLoopsAlternating_nonterminating.bpl [2025-04-26 18:38:47,853 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-04-26 18:38:47,884 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:47,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:47,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:47,887 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 18:38:47,890 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 18:38:47,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 46 transitions, 156 flow [2025-04-26 18:38:47,969 INFO L116 PetriNetUnfolderBase]: 21/54 cut-off events. [2025-04-26 18:38:47,971 INFO L117 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-04-26 18:38:47,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 54 events. 21/54 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 119 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 49. Up to 12 conditions per place. [2025-04-26 18:38:47,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 46 transitions, 156 flow [2025-04-26 18:38:47,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 38 transitions, 136 flow [2025-04-26 18:38:47,979 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 38 transitions, 136 flow [2025-04-26 18:38:47,980 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 38 transitions, 136 flow [2025-04-26 18:38:48,052 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 712 states, 711 states have (on average 3.959212376933896) internal successors, (in total 2815), 711 states have internal predecessors, (2815), 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 18:38:48,057 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 712 states, 711 states have (on average 3.959212376933896) internal successors, (in total 2815), 711 states have internal predecessors, (2815), 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 18:38:48,059 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:48,333 WARN L140 AmpleReduction]: Number of pruned transitions: 774 [2025-04-26 18:38:48,334 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:48,334 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 18:38:48,334 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:130 [2025-04-26 18:38:48,334 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:261 [2025-04-26 18:38:48,334 WARN L145 AmpleReduction]: Times succ was already a loop node:170 [2025-04-26 18:38:48,334 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:48,334 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:48,335 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 420 states, 419 states have (on average 1.9713603818615753) internal successors, (in total 826), 419 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 18:38:48,342 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:48,342 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:48,342 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:48,343 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:48,343 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:48,343 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:48,343 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:48,343 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:48,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 420 states, 419 states have (on average 1.9713603818615753) internal successors, (in total 826), 419 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 18:38:48,369 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 172 [2025-04-26 18:38:48,369 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,369 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:48,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:48,373 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:48,374 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 420 states, 419 states have (on average 1.9713603818615753) internal successors, (in total 826), 419 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 18:38:48,382 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 172 [2025-04-26 18:38:48,382 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:48,382 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:48,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:38:48,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:48,390 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" [2025-04-26 18:38:48,390 INFO L754 eck$LassoCheckResult]: Loop: "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:48,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2912, now seen corresponding path program 1 times [2025-04-26 18:38:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851320874] [2025-04-26 18:38:48,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2025-04-26 18:38:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644897116] [2025-04-26 18:38:48,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2800642, now seen corresponding path program 1 times [2025-04-26 18:38:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:48,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562728432] [2025-04-26 18:38:48,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:48,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:48,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:48,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:48,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:48,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:48,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:48,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:48,515 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,516 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,516 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:48,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:48,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,517 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,603 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:48,604 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:48,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,608 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 18:38:48,609 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 18:38:48,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:48,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:48,668 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 18:38:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,671 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 18:38:48,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:48,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:48,681 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 18:38:48,694 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:48,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:48,701 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:48,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:48,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:48,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:48,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:48,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:48,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:48,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:48,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:48,702 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:48,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:48,730 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:48,733 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:48,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,737 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 18:38:48,741 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 18:38:48,742 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 18:38:48,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:48,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:48,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:48,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:48,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:48,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:48,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:48,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:48,770 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:48,771 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:48,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:48,774 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 18:38:48,776 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 18:38:48,776 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:48,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:48,780 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:48,780 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:48,781 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 18:38:48,818 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 18:38:48,821 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:48,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:48,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:48,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:48,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:48,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:48,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:48,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:48,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:48,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:48,898 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 18:38:48,919 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 18:38:48,921 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 420 states, 419 states have (on average 1.9713603818615753) internal successors, (in total 826), 419 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:38:49,097 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 420 states, 419 states have (on average 1.9713603818615753) internal successors, (in total 826), 419 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 1755 states and 3869 transitions. Complement of second has 7 states. [2025-04-26 18:38:49,099 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 18:38:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:38:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 18:38:49,107 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:38:49,107 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,107 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:38:49,107 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,107 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:38:49,107 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1755 states and 3869 transitions. [2025-04-26 18:38:49,125 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 170 [2025-04-26 18:38:49,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1755 states to 1209 states and 2832 transitions. [2025-04-26 18:38:49,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2025-04-26 18:38:49,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 981 [2025-04-26 18:38:49,147 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1209 states and 2832 transitions. [2025-04-26 18:38:49,147 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,147 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1209 states and 2832 transitions. [2025-04-26 18:38:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states and 2832 transitions. [2025-04-26 18:38:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 698. [2025-04-26 18:38:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 698 states have (on average 2.2951289398280803) internal successors, (in total 1602), 697 states have internal predecessors, (1602), 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 18:38:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1602 transitions. [2025-04-26 18:38:49,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 698 states and 1602 transitions. [2025-04-26 18:38:49,196 INFO L438 stractBuchiCegarLoop]: Abstraction has 698 states and 1602 transitions. [2025-04-26 18:38:49,196 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:49,196 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 698 states and 1602 transitions. [2025-04-26 18:38:49,199 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 170 [2025-04-26 18:38:49,200 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:49,200 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:49,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:38:49,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:49,201 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[68] L21-->oneFINAL: Formula: (not (= v_x_6 1)) InVars {x=v_x_6} OutVars{x=v_x_6} AuxVars[] AssignedVars[]" "[70] oneFINAL-->oneEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:49,201 INFO L754 eck$LassoCheckResult]: Loop: "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:49,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash 86832372, now seen corresponding path program 1 times [2025-04-26 18:38:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600354388] [2025-04-26 18:38:49,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:49,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:49,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,235 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 18:38:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:49,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600354388] [2025-04-26 18:38:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600354388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:49,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:49,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:49,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516976695] [2025-04-26 18:38:49,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:49,239 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:49,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,239 INFO L85 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2025-04-26 18:38:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103602730] [2025-04-26 18:38:49,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,254 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,254 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:49,255 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:49,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,255 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,278 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,279 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,284 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 18:38:49,287 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 18:38:49,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:38:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,321 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 18:38:49,322 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 18:38:49,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,337 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:38:49,348 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,348 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,349 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,349 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,349 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,349 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:49,349 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,349 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,382 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,382 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:49,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,384 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 18:38:49,386 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 18:38:49,387 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 18:38:49,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,403 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,403 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:49,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,405 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 18:38:49,407 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 18:38:49,407 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:38:49,411 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,411 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,411 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2025-04-26 18:38:49,418 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 18:38:49,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:49,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,473 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 18:38:49,473 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 18:38:49,473 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 698 states and 1602 transitions. cyclomatic complexity: 987 Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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 18:38:49,602 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 698 states and 1602 transitions. cyclomatic complexity: 987. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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) Result 1130 states and 2512 transitions. Complement of second has 9 states. [2025-04-26 18:38:49,602 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 18:38:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) 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 18:38:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-26 18:38:49,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:38:49,603 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:38:49,603 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:38:49,603 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:49,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1130 states and 2512 transitions. [2025-04-26 18:38:49,613 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 170 [2025-04-26 18:38:49,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1130 states to 974 states and 2220 transitions. [2025-04-26 18:38:49,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2025-04-26 18:38:49,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2025-04-26 18:38:49,622 INFO L74 IsDeterministic]: Start isDeterministic. Operand 974 states and 2220 transitions. [2025-04-26 18:38:49,623 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 974 states and 2220 transitions. [2025-04-26 18:38:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states and 2220 transitions. [2025-04-26 18:38:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 788. [2025-04-26 18:38:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 788 states have (on average 2.3236040609137056) internal successors, (in total 1831), 787 states have internal predecessors, (1831), 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 18:38:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1831 transitions. [2025-04-26 18:38:49,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 788 states and 1831 transitions. [2025-04-26 18:38:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:49,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:49,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:49,648 INFO L87 Difference]: Start difference. First operand 788 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:49,713 INFO L93 Difference]: Finished difference Result 1074 states and 2234 transitions. [2025-04-26 18:38:49,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1074 states and 2234 transitions. [2025-04-26 18:38:49,720 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 196 [2025-04-26 18:38:49,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1074 states to 981 states and 2087 transitions. [2025-04-26 18:38:49,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 645 [2025-04-26 18:38:49,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 645 [2025-04-26 18:38:49,728 INFO L74 IsDeterministic]: Start isDeterministic. Operand 981 states and 2087 transitions. [2025-04-26 18:38:49,728 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:49,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 981 states and 2087 transitions. [2025-04-26 18:38:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states and 2087 transitions. [2025-04-26 18:38:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 929. [2025-04-26 18:38:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 929 states have (on average 2.1668460710441333) internal successors, (in total 2013), 928 states have internal predecessors, (2013), 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 18:38:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2013 transitions. [2025-04-26 18:38:49,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 929 states and 2013 transitions. [2025-04-26 18:38:49,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:49,765 INFO L438 stractBuchiCegarLoop]: Abstraction has 929 states and 2013 transitions. [2025-04-26 18:38:49,765 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:49,765 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 929 states and 2013 transitions. [2025-04-26 18:38:49,769 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 190 [2025-04-26 18:38:49,769 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:49,769 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:49,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:49,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:49,770 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:49,770 INFO L754 eck$LassoCheckResult]: Loop: "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:49,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1841564086, now seen corresponding path program 1 times [2025-04-26 18:38:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243039868] [2025-04-26 18:38:49,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:49,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:49,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2025-04-26 18:38:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224971533] [2025-04-26 18:38:49,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:49,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:49,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:49,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash 216562904, now seen corresponding path program 2 times [2025-04-26 18:38:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:49,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488235479] [2025-04-26 18:38:49,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:49,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-26 18:38:49,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:49,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:38:49,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:38:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:49,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488235479] [2025-04-26 18:38:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488235479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:49,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:49,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866203194] [2025-04-26 18:38:49,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:49,823 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,824 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,824 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,824 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,824 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:49,824 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,824 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,824 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:49,824 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,824 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,840 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,840 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,842 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 18:38:49,843 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 18:38:49,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:49,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:38:49,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,862 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 18:38:49,863 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 18:38:49,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:49,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:49,875 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:49,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:38:49,881 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:49,881 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:49,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:49,881 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:49,881 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:49,881 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,881 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:49,881 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:49,881 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 18:38:49,881 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:49,881 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:49,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:49,898 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:49,898 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:49,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,900 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 18:38:49,901 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 18:38:49,903 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 18:38:49,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:49,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:49,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:49,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:49,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:49,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:49,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:49,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:49,918 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:49,918 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:49,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:49,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:49,920 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 18:38:49,920 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 18:38:49,921 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:49,924 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 18:38:49,924 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:49,924 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:49,924 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 18:38:49,931 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 18:38:49,931 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:49,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:49,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:49,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:49,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:49,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:49,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:49,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:49,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:49,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:49,963 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 18:38:49,964 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 18:38:49,964 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 929 states and 2013 transitions. cyclomatic complexity: 1165 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 18:38:50,080 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 929 states and 2013 transitions. cyclomatic complexity: 1165. 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 2947 states and 6564 transitions. Complement of second has 7 states. [2025-04-26 18:38:50,080 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 18:38:50,081 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 18:38:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 18:38:50,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:38:50,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:50,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:38:50,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:50,081 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:38:50,081 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:50,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2947 states and 6564 transitions. [2025-04-26 18:38:50,100 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 342 [2025-04-26 18:38:50,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2947 states to 2397 states and 5407 transitions. [2025-04-26 18:38:50,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1462 [2025-04-26 18:38:50,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1728 [2025-04-26 18:38:50,117 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2397 states and 5407 transitions. [2025-04-26 18:38:50,117 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2397 states and 5407 transitions. [2025-04-26 18:38:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states and 5407 transitions. [2025-04-26 18:38:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1292. [2025-04-26 18:38:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1292 states have (on average 2.421826625386997) internal successors, (in total 3129), 1291 states have internal predecessors, (3129), 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 18:38:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3129 transitions. [2025-04-26 18:38:50,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1292 states and 3129 transitions. [2025-04-26 18:38:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:50,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:50,148 INFO L87 Difference]: Start difference. First operand 1292 states and 3129 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 18:38:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,202 INFO L93 Difference]: Finished difference Result 1454 states and 2906 transitions. [2025-04-26 18:38:50,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1454 states and 2906 transitions. [2025-04-26 18:38:50,209 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 267 [2025-04-26 18:38:50,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1454 states to 1209 states and 2427 transitions. [2025-04-26 18:38:50,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1001 [2025-04-26 18:38:50,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1044 [2025-04-26 18:38:50,215 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1209 states and 2427 transitions. [2025-04-26 18:38:50,216 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1209 states and 2427 transitions. [2025-04-26 18:38:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states and 2427 transitions. [2025-04-26 18:38:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 690. [2025-04-26 18:38:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 690 states have (on average 2.017391304347826) internal successors, (in total 1392), 689 states have internal predecessors, (1392), 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 18:38:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1392 transitions. [2025-04-26 18:38:50,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 690 states and 1392 transitions. [2025-04-26 18:38:50,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:50,231 INFO L438 stractBuchiCegarLoop]: Abstraction has 690 states and 1392 transitions. [2025-04-26 18:38:50,231 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:38:50,231 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 690 states and 1392 transitions. [2025-04-26 18:38:50,233 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 187 [2025-04-26 18:38:50,233 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,233 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:38:50,234 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" [2025-04-26 18:38:50,234 INFO L754 eck$LassoCheckResult]: Loop: "[75] L38-->L37: Formula: (= v_x_9 4) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" "[73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" [2025-04-26 18:38:50,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1841577348, now seen corresponding path program 1 times [2025-04-26 18:38:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900248674] [2025-04-26 18:38:50,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,259 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 18:38:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900248674] [2025-04-26 18:38:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900248674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598667088] [2025-04-26 18:38:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,259 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:50,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 3359, now seen corresponding path program 1 times [2025-04-26 18:38:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814696254] [2025-04-26 18:38:50,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:38:50,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:38:50,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,270 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 18:38:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814696254] [2025-04-26 18:38:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814696254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:38:50,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282526067] [2025-04-26 18:38:50,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,271 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:50,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:50,271 INFO L87 Difference]: Start difference. First operand 690 states and 1392 transitions. cyclomatic complexity: 767 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (in total 2), 2 states have internal predecessors, (2), 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 18:38:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,327 INFO L93 Difference]: Finished difference Result 862 states and 1639 transitions. [2025-04-26 18:38:50,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 862 states and 1639 transitions. [2025-04-26 18:38:50,331 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 142 [2025-04-26 18:38:50,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 862 states to 614 states and 1180 transitions. [2025-04-26 18:38:50,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 483 [2025-04-26 18:38:50,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 483 [2025-04-26 18:38:50,335 INFO L74 IsDeterministic]: Start isDeterministic. Operand 614 states and 1180 transitions. [2025-04-26 18:38:50,335 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 614 states and 1180 transitions. [2025-04-26 18:38:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states and 1180 transitions. [2025-04-26 18:38:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 506. [2025-04-26 18:38:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 506 states have (on average 2.0237154150197627) internal successors, (in total 1024), 505 states have internal predecessors, (1024), 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 18:38:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1024 transitions. [2025-04-26 18:38:50,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 506 states and 1024 transitions. [2025-04-26 18:38:50,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:50,345 INFO L438 stractBuchiCegarLoop]: Abstraction has 506 states and 1024 transitions. [2025-04-26 18:38:50,345 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:38:50,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 506 states and 1024 transitions. [2025-04-26 18:38:50,347 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 131 [2025-04-26 18:38:50,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,347 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:38:50,348 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[88] L10-->L45: Formula: (= v_fourThread1of1ForFork2_thidvar0_2 4) InVars {} OutVars{fourThread1of1ForFork2_thidvar0=v_fourThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[fourThread1of1ForFork2_thidvar0]" "[65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" [2025-04-26 18:38:50,348 INFO L754 eck$LassoCheckResult]: Loop: "[67] L46-->L45: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" [2025-04-26 18:38:50,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1268623150, now seen corresponding path program 1 times [2025-04-26 18:38:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916332732] [2025-04-26 18:38:50,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:50,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:50,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:50,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916332732] [2025-04-26 18:38:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916332732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638436753] [2025-04-26 18:38:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,374 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:50,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2988093, now seen corresponding path program 1 times [2025-04-26 18:38:50,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576323600] [2025-04-26 18:38:50,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:50,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:50,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576323600] [2025-04-26 18:38:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576323600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618878277] [2025-04-26 18:38:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,394 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:50,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:50,394 INFO L87 Difference]: Start difference. First operand 506 states and 1024 transitions. cyclomatic complexity: 562 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 18:38:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,429 INFO L93 Difference]: Finished difference Result 576 states and 1080 transitions. [2025-04-26 18:38:50,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 1080 transitions. [2025-04-26 18:38:50,432 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 127 [2025-04-26 18:38:50,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 523 states and 977 transitions. [2025-04-26 18:38:50,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2025-04-26 18:38:50,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2025-04-26 18:38:50,435 INFO L74 IsDeterministic]: Start isDeterministic. Operand 523 states and 977 transitions. [2025-04-26 18:38:50,436 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:38:50,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 523 states and 977 transitions. [2025-04-26 18:38:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 977 transitions. [2025-04-26 18:38:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 455. [2025-04-26 18:38:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 455 states have (on average 1.9076923076923078) internal successors, (in total 868), 454 states have internal predecessors, (868), 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 18:38:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 868 transitions. [2025-04-26 18:38:50,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 455 states and 868 transitions. [2025-04-26 18:38:50,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:50,447 INFO L438 stractBuchiCegarLoop]: Abstraction has 455 states and 868 transitions. [2025-04-26 18:38:50,448 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:38:50,448 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 868 transitions. [2025-04-26 18:38:50,449 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 116 [2025-04-26 18:38:50,449 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,450 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:38:50,451 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:50,451 INFO L754 eck$LassoCheckResult]: Loop: "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:50,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1253911587, now seen corresponding path program 3 times [2025-04-26 18:38:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989627183] [2025-04-26 18:38:50,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:38:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 2 equivalence classes. [2025-04-26 18:38:50,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 6 of 8 statements. [2025-04-26 18:38:50,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:38:50,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:38:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989627183] [2025-04-26 18:38:50,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989627183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148700278] [2025-04-26 18:38:50,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,475 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:50,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,475 INFO L85 PathProgramCache]: Analyzing trace with hash 3114897, now seen corresponding path program 1 times [2025-04-26 18:38:50,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798197558] [2025-04-26 18:38:50,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:38:50,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:38:50,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,492 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 18:38:50,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798197558] [2025-04-26 18:38:50,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798197558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:38:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498475402] [2025-04-26 18:38:50,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,493 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:50,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:50,493 INFO L87 Difference]: Start difference. First operand 455 states and 868 transitions. cyclomatic complexity: 454 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 2 states have internal predecessors, (4), 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 18:38:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,555 INFO L93 Difference]: Finished difference Result 444 states and 710 transitions. [2025-04-26 18:38:50,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 444 states and 710 transitions. [2025-04-26 18:38:50,557 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2025-04-26 18:38:50,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 444 states to 128 states and 227 transitions. [2025-04-26 18:38:50,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-04-26 18:38:50,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2025-04-26 18:38:50,558 INFO L74 IsDeterministic]: Start isDeterministic. Operand 128 states and 227 transitions. [2025-04-26 18:38:50,558 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:50,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 128 states and 227 transitions. [2025-04-26 18:38:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 227 transitions. [2025-04-26 18:38:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 103. [2025-04-26 18:38:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.8446601941747574) internal successors, (in total 190), 102 states have internal predecessors, (190), 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 18:38:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2025-04-26 18:38:50,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 190 transitions. [2025-04-26 18:38:50,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:50,563 INFO L438 stractBuchiCegarLoop]: Abstraction has 103 states and 190 transitions. [2025-04-26 18:38:50,563 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:38:50,563 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 190 transitions. [2025-04-26 18:38:50,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2025-04-26 18:38:50,563 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,563 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:38:50,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,564 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0]" "[88] L10-->L45: Formula: (= v_fourThread1of1ForFork2_thidvar0_2 4) InVars {} OutVars{fourThread1of1ForFork2_thidvar0=v_fourThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[fourThread1of1ForFork2_thidvar0]" [2025-04-26 18:38:50,564 INFO L754 eck$LassoCheckResult]: Loop: "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" "[65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[67] L46-->L45: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:50,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 86832917, now seen corresponding path program 1 times [2025-04-26 18:38:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691142970] [2025-04-26 18:38:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:50,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:50,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:50,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1364110297, now seen corresponding path program 1 times [2025-04-26 18:38:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24876299] [2025-04-26 18:38:50,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:50,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:50,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:50,592 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 18:38:50,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:50,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24876299] [2025-04-26 18:38:50,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24876299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:50,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:50,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:50,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30049254] [2025-04-26 18:38:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:50,593 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:38:50,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:50,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:38:50,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:38:50,593 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. cyclomatic complexity: 90 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 18:38:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:50,606 INFO L93 Difference]: Finished difference Result 58 states and 86 transitions. [2025-04-26 18:38:50,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 86 transitions. [2025-04-26 18:38:50,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 18:38:50,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 25 states and 37 transitions. [2025-04-26 18:38:50,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 18:38:50,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 18:38:50,607 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 37 transitions. [2025-04-26 18:38:50,607 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:50,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-04-26 18:38:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 37 transitions. [2025-04-26 18:38:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-04-26 18:38:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.48) internal successors, (in total 37), 24 states have internal predecessors, (37), 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 18:38:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2025-04-26 18:38:50,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-04-26 18:38:50,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:38:50,608 INFO L438 stractBuchiCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-04-26 18:38:50,608 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:38:50,608 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 37 transitions. [2025-04-26 18:38:50,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 18:38:50,609 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:50,609 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:50,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:38:50,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:50,609 INFO L752 eck$LassoCheckResult]: Stem: "[60] $Ultimate##0-->L8: Formula: (= v_x_7 1) InVars {} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[91] L8-->L21: Formula: (= v_oneThread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork3_thidvar0=v_oneThread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork3_thidvar0]" "[82] L8-1-->L29: Formula: (= v_twoThread1of1ForFork0_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork0_thidvar0=v_twoThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork0_thidvar0]" "[85] L9-->L37: Formula: (= v_threeThread1of1ForFork1_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork1_thidvar0=v_threeThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork1_thidvar0]" "[88] L10-->L45: Formula: (= v_fourThread1of1ForFork2_thidvar0_2 4) InVars {} OutVars{fourThread1of1ForFork2_thidvar0=v_fourThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[fourThread1of1ForFork2_thidvar0]" [2025-04-26 18:38:50,609 INFO L754 eck$LassoCheckResult]: Loop: "[69] L21-->L22: Formula: (= v_x_4 1) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[71] L22-->L21: Formula: (= 2 v_x_5) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" "[73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[75] L38-->L37: Formula: (= v_x_9 4) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" "[65] L45-->L46: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[67] L46-->L45: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:38:50,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 86832917, now seen corresponding path program 2 times [2025-04-26 18:38:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339758100] [2025-04-26 18:38:50,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:38:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:50,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:50,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:38:50,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:50,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:50,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -944722039, now seen corresponding path program 1 times [2025-04-26 18:38:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824476196] [2025-04-26 18:38:50,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:50,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:50,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:50,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:50,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2102350493, now seen corresponding path program 1 times [2025-04-26 18:38:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:50,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776207715] [2025-04-26 18:38:50,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:50,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:50,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:50,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:50,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:50,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:50,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:50,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:50,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:38:50,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:38:50,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:50,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:50,693 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 18:38:50,703 INFO L201 PluginConnector]: Adding new model Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:50 BoogieIcfgContainer [2025-04-26 18:38:50,703 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:50,704 INFO L158 Benchmark]: Toolchain (without parser) took 3145.83ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.2MB in the beginning and 85.4MB in the end (delta: 785.5kB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,704 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.56ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,704 INFO L158 Benchmark]: Boogie Preprocessor took 23.70ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 993.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,704 INFO L158 Benchmark]: RCFGBuilder took 171.82ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:50,704 INFO L158 Benchmark]: BuchiAutomizer took 2909.49ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.4MB in the beginning and 85.4MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:50,705 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.76ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.56ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.70ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 993.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 171.82ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 74.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2909.49ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.4MB in the beginning and 85.4MB in the end (delta: -11.1MB). 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.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 2574 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 598 IncrementalHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 170 mSDtfsCounter, 598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT1 SILN0 SILU0 SILI3 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 47ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 454, Number of transitions in reduction automaton: 826, Number of states in reduction automaton: 420, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 25 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L10] FORK 0 fork 3 three(); VAL [x=1] [L11] FORK 0 fork 4 four(); VAL [x=1] Loop: [L21] COND TRUE x == 1 [L22] x := 2; [L29] COND TRUE x == 2 [L30] x := 3; [L37] COND TRUE x == 3 [L38] x := 4; [L45] COND TRUE x == 4 [L46] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L10] FORK 0 fork 3 three(); VAL [x=1] [L11] FORK 0 fork 4 four(); VAL [x=1] Loop: [L21] COND TRUE x == 1 [L22] x := 2; [L29] COND TRUE x == 2 [L30] x := 3; [L37] COND TRUE x == 3 [L38] x := 4; [L45] COND TRUE x == 4 [L46] x := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:38:50,719 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...