/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/buchiAutomizer/concurrent-automaton-noLbe.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 16:20:44,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:44,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:44,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:44,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:44,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:44,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:44,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:44,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:44,719 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:44,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:44,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:44,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:44,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:44,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:44,722 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:44,722 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:44,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:44,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:44,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:44,972 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:44,972 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:44,974 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 16:20:44,975 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/Nconcurrent_FourLoopsAlternating_nonterminating.bpl' [2025-04-26 16:20:44,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:44,993 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:44,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:44,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:44,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:45,002 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,021 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,027 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:45,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:45,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:45,034 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,034 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,036 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,036 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,037 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,037 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,041 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,041 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,041 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:45,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:45,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:45,051 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 04:20:44" (1/1) ... [2025-04-26 16:20:45,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:45,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:45,100 INFO L124 BoogieDeclarations]: Specification and implementation of procedure four given in one single declaration [2025-04-26 16:20:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure four [2025-04-26 16:20:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure four [2025-04-26 16:20:45,100 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 16:20:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 16:20:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 16:20:45,100 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:45,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 16:20:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 16:20:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 16:20:45,101 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 16:20:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 16:20:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 16:20:45,102 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:45,133 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:45,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:45,197 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:45,197 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:45,204 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:45,204 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:45,205 INFO L201 PluginConnector]: Adding new model Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45 BoogieIcfgContainer [2025-04-26 16:20:45,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:45,205 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:45,206 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:45,210 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:45,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,210 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 04:20:44" (1/2) ... [2025-04-26 16:20:45,211 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53f61143 and model type Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:45, skipping insertion in model container [2025-04-26 16:20:45,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,211 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 04:20:45" (2/2) ... [2025-04-26 16:20:45,212 INFO L376 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_FourLoopsAlternating_nonterminating.bpl [2025-04-26 16:20:45,256 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-04-26 16:20:45,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 46 transitions, 156 flow [2025-04-26 16:20:45,324 INFO L116 PetriNetUnfolderBase]: 21/54 cut-off events. [2025-04-26 16:20:45,326 INFO L117 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-04-26 16:20:45,332 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 16:20:45,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 46 transitions, 156 flow [2025-04-26 16:20:45,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 38 transitions, 136 flow [2025-04-26 16:20:45,339 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 38 transitions, 136 flow [2025-04-26 16:20:45,349 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:45,349 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:45,349 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:45,349 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:45,349 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:45,349 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:45,349 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:45,349 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:45,350 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:45,515 INFO L131 ngComponentsAnalysis]: Automaton has 200 accepting balls. 614 [2025-04-26 16:20:45,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:45,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:45,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:45,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:45,522 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:45,522 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 711 states, but on-demand construction may add more states [2025-04-26 16:20:45,542 INFO L131 ngComponentsAnalysis]: Automaton has 200 accepting balls. 614 [2025-04-26 16:20:45,543 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:45,543 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:45,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:45,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:45,547 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 16:20:45,548 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 16:20:45,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2912, now seen corresponding path program 1 times [2025-04-26 16:20:45,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562074131] [2025-04-26 16:20:45,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2025-04-26 16:20:45,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397646299] [2025-04-26 16:20:45,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2800642, now seen corresponding path program 1 times [2025-04-26 16:20:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546118528] [2025-04-26 16:20:45,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:45,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:45,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:45,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:45,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,738 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:45,739 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:45,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:45,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:45,739 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:45,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:45,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:45,740 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:45,740 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:45,740 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:45,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:45,794 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:45,794 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:45,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:45,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:45,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:45,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:45,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:45,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:20:45,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:45,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:45,849 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:45,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:45,856 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:45,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:45,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:45,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:45,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:45,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:45,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:45,856 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:45,856 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:45,856 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:45,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:45,886 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:45,889 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:45,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:45,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:20:45,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:45,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:45,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:45,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:45,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:45,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:45,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:45,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:45,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:45,928 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:45,928 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:45,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:45,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:20:45,935 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:45,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:20:45,940 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:45,941 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:45,941 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 16:20:45,948 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 16:20:45,951 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:45,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:45,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:45,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:45,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:45,993 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:45,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:46,082 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:46,085 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 711 states, but on-demand construction may add more states 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 16:20:46,367 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 711 states, but on-demand construction may add more states. 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 3402 states and 13796 transitions. Complement of second has 7 states. [2025-04-26 16:20:46,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:46,371 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 16:20:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 16:20:46,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:20:46,379 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:46,380 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,380 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:20:46,380 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3402 states and 13796 transitions. [2025-04-26 16:20:46,443 INFO L131 ngComponentsAnalysis]: Automaton has 199 accepting balls. 612 [2025-04-26 16:20:46,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3402 states to 2223 states and 9248 transitions. [2025-04-26 16:20:46,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1220 [2025-04-26 16:20:46,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1867 [2025-04-26 16:20:46,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2223 states and 9248 transitions. [2025-04-26 16:20:46,497 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2223 states and 9248 transitions. [2025-04-26 16:20:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states and 9248 transitions. [2025-04-26 16:20:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1103. [2025-04-26 16:20:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1103 states have (on average 4.231187669990934) internal successors, (in total 4667), 1102 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 4667 transitions. [2025-04-26 16:20:46,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1103 states and 4667 transitions. [2025-04-26 16:20:46,617 INFO L438 stractBuchiCegarLoop]: Abstraction has 1103 states and 4667 transitions. [2025-04-26 16:20:46,617 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:46,618 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1103 states and 4667 transitions. [2025-04-26 16:20:46,625 INFO L131 ngComponentsAnalysis]: Automaton has 199 accepting balls. 612 [2025-04-26 16:20:46,625 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,625 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:46,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,626 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[]" [2025-04-26 16:20:46,626 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 16:20:46,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2801042, now seen corresponding path program 1 times [2025-04-26 16:20:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700893381] [2025-04-26 16:20:46,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:46,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:46,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700893381] [2025-04-26 16:20:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700893381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:20:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329229059] [2025-04-26 16:20:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:46,654 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:46,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2025-04-26 16:20:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325978732] [2025-04-26 16:20:46,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,670 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,670 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,670 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,687 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,687 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:20:46,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:20:46,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,718 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:20:46,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,732 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,739 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 16:20:46,739 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,739 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,739 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_FourLoopsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,739 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,739 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,758 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,758 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:20:46,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:46,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,780 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:46,780 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:46,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,782 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:46,785 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,788 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:20:46,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,789 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,789 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,789 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2025-04-26 16:20:46,796 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 16:20:46,797 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:46,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:46,846 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:46,846 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1103 states and 4667 transitions. cyclomatic complexity: 3857 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,014 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1103 states and 4667 transitions. cyclomatic complexity: 3857. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2803 states and 11305 transitions. Complement of second has 9 states. [2025-04-26 16:20:47,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-04-26 16:20:47,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 117 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:47,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,016 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 117 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:47,016 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,016 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 117 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:20:47,016 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2803 states and 11305 transitions. [2025-04-26 16:20:47,078 INFO L131 ngComponentsAnalysis]: Automaton has 199 accepting balls. 612 [2025-04-26 16:20:47,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2803 states to 2154 states and 8731 transitions. [2025-04-26 16:20:47,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1158 [2025-04-26 16:20:47,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1590 [2025-04-26 16:20:47,103 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2154 states and 8731 transitions. [2025-04-26 16:20:47,103 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2154 states and 8731 transitions. [2025-04-26 16:20:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states and 8731 transitions. [2025-04-26 16:20:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1357. [2025-04-26 16:20:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1357 states have (on average 4.258658806190125) internal successors, (in total 5779), 1356 states have internal predecessors, (5779), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 5779 transitions. [2025-04-26 16:20:47,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1357 states and 5779 transitions. [2025-04-26 16:20:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,140 INFO L87 Difference]: Start difference. First operand 1357 states and 5779 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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 16:20:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,236 INFO L93 Difference]: Finished difference Result 1952 states and 7450 transitions. [2025-04-26 16:20:47,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1952 states and 7450 transitions. [2025-04-26 16:20:47,256 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 704 [2025-04-26 16:20:47,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1952 states to 1708 states and 6585 transitions. [2025-04-26 16:20:47,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1095 [2025-04-26 16:20:47,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1095 [2025-04-26 16:20:47,274 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1708 states and 6585 transitions. [2025-04-26 16:20:47,274 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1708 states and 6585 transitions. [2025-04-26 16:20:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states and 6585 transitions. [2025-04-26 16:20:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1514. [2025-04-26 16:20:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1514 states have (on average 3.950462351387054) internal successors, (in total 5981), 1513 states have internal predecessors, (5981), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 5981 transitions. [2025-04-26 16:20:47,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1514 states and 5981 transitions. [2025-04-26 16:20:47,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,314 INFO L438 stractBuchiCegarLoop]: Abstraction has 1514 states and 5981 transitions. [2025-04-26 16:20:47,314 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:47,314 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1514 states and 5981 transitions. [2025-04-26 16:20:47,326 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 676 [2025-04-26 16:20:47,326 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,326 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,327 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[]" "[68] L21-->oneFINAL: Formula: (not (= v_x_6 1)) InVars {x=v_x_6} OutVars{x=v_x_6} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,327 INFO L754 eck$LassoCheckResult]: Loop: "[79] L30-->L29: Formula: (= v_x_12 3) InVars {} OutVars{x=v_x_12} AuxVars[] AssignedVars[x]" "[77] L29-->L30: Formula: (= v_x_11 2) InVars {x=v_x_11} OutVars{x=v_x_11} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1841564075, now seen corresponding path program 1 times [2025-04-26 16:20:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8488867] [2025-04-26 16:20:47,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 2 times [2025-04-26 16:20:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039537949] [2025-04-26 16:20:47,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:20:47,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039537949] [2025-04-26 16:20:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039537949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:20:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372744563] [2025-04-26 16:20:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,364 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,364 INFO L87 Difference]: Start difference. First operand 1514 states and 5981 transitions. cyclomatic complexity: 4776 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 16:20:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,472 INFO L93 Difference]: Finished difference Result 1915 states and 6903 transitions. [2025-04-26 16:20:47,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1915 states and 6903 transitions. [2025-04-26 16:20:47,490 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 648 [2025-04-26 16:20:47,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1915 states to 1521 states and 5396 transitions. [2025-04-26 16:20:47,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1142 [2025-04-26 16:20:47,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1263 [2025-04-26 16:20:47,503 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1521 states and 5396 transitions. [2025-04-26 16:20:47,504 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1521 states and 5396 transitions. [2025-04-26 16:20:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states and 5396 transitions. [2025-04-26 16:20:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 993. [2025-04-26 16:20:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 993 states have (on average 3.6827794561933533) internal successors, (in total 3657), 992 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 3657 transitions. [2025-04-26 16:20:47,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 993 states and 3657 transitions. [2025-04-26 16:20:47,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,529 INFO L438 stractBuchiCegarLoop]: Abstraction has 993 states and 3657 transitions. [2025-04-26 16:20:47,529 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:47,529 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 993 states and 3657 transitions. [2025-04-26 16:20:47,534 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 616 [2025-04-26 16:20:47,535 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,535 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,536 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]" "[73] L37-->L38: Formula: (= 3 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,536 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 16:20:47,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1842038628, now seen corresponding path program 1 times [2025-04-26 16:20:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198110994] [2025-04-26 16:20:47,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,558 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 16:20:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198110994] [2025-04-26 16:20:47,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198110994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:47,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711589238] [2025-04-26 16:20:47,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,559 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 3359, now seen corresponding path program 1 times [2025-04-26 16:20:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176799362] [2025-04-26 16:20:47,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176799362] [2025-04-26 16:20:47,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176799362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:20:47,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624006533] [2025-04-26 16:20:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,570 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,570 INFO L87 Difference]: Start difference. First operand 993 states and 3657 transitions. cyclomatic complexity: 2917 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 16:20:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,627 INFO L93 Difference]: Finished difference Result 1262 states and 4444 transitions. [2025-04-26 16:20:47,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1262 states and 4444 transitions. [2025-04-26 16:20:47,635 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 399 [2025-04-26 16:20:47,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1262 states to 839 states and 2874 transitions. [2025-04-26 16:20:47,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 655 [2025-04-26 16:20:47,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 655 [2025-04-26 16:20:47,641 INFO L74 IsDeterministic]: Start isDeterministic. Operand 839 states and 2874 transitions. [2025-04-26 16:20:47,641 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 839 states and 2874 transitions. [2025-04-26 16:20:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 2874 transitions. [2025-04-26 16:20:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 667. [2025-04-26 16:20:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 667 states have (on average 3.5112443778110944) internal successors, (in total 2342), 666 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2342 transitions. [2025-04-26 16:20:47,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 667 states and 2342 transitions. [2025-04-26 16:20:47,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,671 INFO L438 stractBuchiCegarLoop]: Abstraction has 667 states and 2342 transitions. [2025-04-26 16:20:47,671 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:20:47,671 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 2342 transitions. [2025-04-26 16:20:47,673 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 376 [2025-04-26 16:20:47,674 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,674 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:20:47,674 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]" "[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 16:20:47,674 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 16:20:47,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1254323470, now seen corresponding path program 1 times [2025-04-26 16:20:47,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481358838] [2025-04-26 16:20:47,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481358838] [2025-04-26 16:20:47,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481358838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059805969] [2025-04-26 16:20:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,692 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2988093, now seen corresponding path program 1 times [2025-04-26 16:20:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902327737] [2025-04-26 16:20:47,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,703 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 16:20:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902327737] [2025-04-26 16:20:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902327737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100225206] [2025-04-26 16:20:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,704 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,704 INFO L87 Difference]: Start difference. First operand 667 states and 2342 transitions. cyclomatic complexity: 1835 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 16:20:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,751 INFO L93 Difference]: Finished difference Result 785 states and 2619 transitions. [2025-04-26 16:20:47,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 2619 transitions. [2025-04-26 16:20:47,755 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 356 [2025-04-26 16:20:47,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 705 states and 2346 transitions. [2025-04-26 16:20:47,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2025-04-26 16:20:47,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2025-04-26 16:20:47,760 INFO L74 IsDeterministic]: Start isDeterministic. Operand 705 states and 2346 transitions. [2025-04-26 16:20:47,762 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 2346 transitions. [2025-04-26 16:20:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 2346 transitions. [2025-04-26 16:20:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 589. [2025-04-26 16:20:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 589 states have (on average 3.3191850594227503) internal successors, (in total 1955), 588 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1955 transitions. [2025-04-26 16:20:47,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 589 states and 1955 transitions. [2025-04-26 16:20:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,773 INFO L438 stractBuchiCegarLoop]: Abstraction has 589 states and 1955 transitions. [2025-04-26 16:20:47,773 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:20:47,773 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 589 states and 1955 transitions. [2025-04-26 16:20:47,775 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 327 [2025-04-26 16:20:47,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:20:47,776 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 16:20:47,776 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 16:20:47,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1253911587, now seen corresponding path program 1 times [2025-04-26 16:20:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894928389] [2025-04-26 16:20:47,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,797 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 16:20:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894928389] [2025-04-26 16:20:47,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894928389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085522327] [2025-04-26 16:20:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,797 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash 3114897, now seen corresponding path program 1 times [2025-04-26 16:20:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042440925] [2025-04-26 16:20:47,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042440925] [2025-04-26 16:20:47,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042440925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:47,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36452571] [2025-04-26 16:20:47,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,818 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,818 INFO L87 Difference]: Start difference. First operand 589 states and 1955 transitions. cyclomatic complexity: 1512 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 16:20:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,886 INFO L93 Difference]: Finished difference Result 648 states and 1919 transitions. [2025-04-26 16:20:47,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 1919 transitions. [2025-04-26 16:20:47,893 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 68 [2025-04-26 16:20:47,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 131 states and 307 transitions. [2025-04-26 16:20:47,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-04-26 16:20:47,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2025-04-26 16:20:47,894 INFO L74 IsDeterministic]: Start isDeterministic. Operand 131 states and 307 transitions. [2025-04-26 16:20:47,896 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:47,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 131 states and 307 transitions. [2025-04-26 16:20:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 307 transitions. [2025-04-26 16:20:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2025-04-26 16:20:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.436893203883495) internal successors, (in total 251), 102 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 251 transitions. [2025-04-26 16:20:47,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 251 transitions. [2025-04-26 16:20:47,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,900 INFO L438 stractBuchiCegarLoop]: Abstraction has 103 states and 251 transitions. [2025-04-26 16:20:47,900 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:20:47,900 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 251 transitions. [2025-04-26 16:20:47,901 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 67 [2025-04-26 16:20:47,901 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,901 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:47,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,902 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 16:20:47,902 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 16:20:47,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 86832917, now seen corresponding path program 1 times [2025-04-26 16:20:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100142961] [2025-04-26 16:20:47,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:47,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:47,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:47,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:47,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1364110297, now seen corresponding path program 1 times [2025-04-26 16:20:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691199466] [2025-04-26 16:20:47,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:20:47,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691199466] [2025-04-26 16:20:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691199466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:47,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:47,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719082389] [2025-04-26 16:20:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,935 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:20:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,935 INFO L87 Difference]: Start difference. First operand 103 states and 251 transitions. cyclomatic complexity: 155 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,954 INFO L93 Difference]: Finished difference Result 58 states and 108 transitions. [2025-04-26 16:20:47,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 108 transitions. [2025-04-26 16:20:47,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 16:20:47,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 25 states and 37 transitions. [2025-04-26 16:20:47,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 16:20:47,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 16:20:47,955 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 37 transitions. [2025-04-26 16:20:47,955 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:47,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-04-26 16:20:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 37 transitions. [2025-04-26 16:20:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-04-26 16:20:47,955 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 16:20:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2025-04-26 16:20:47,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-04-26 16:20:47,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,956 INFO L438 stractBuchiCegarLoop]: Abstraction has 25 states and 37 transitions. [2025-04-26 16:20:47,956 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:20:47,956 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 37 transitions. [2025-04-26 16:20:47,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 16:20:47,956 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,956 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:47,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,957 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 16:20:47,957 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 16:20:47,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash 86832917, now seen corresponding path program 2 times [2025-04-26 16:20:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245650808] [2025-04-26 16:20:47,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:47,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:47,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:20:47,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:47,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:47,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash -944722039, now seen corresponding path program 1 times [2025-04-26 16:20:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57842719] [2025-04-26 16:20:47,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2102350493, now seen corresponding path program 1 times [2025-04-26 16:20:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905533706] [2025-04-26 16:20:47,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:20:47,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:47,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:20:47,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:47,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:48,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:48,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:48,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:48,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,083 INFO L201 PluginConnector]: Adding new model Nconcurrent_FourLoopsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:48 BoogieIcfgContainer [2025-04-26 16:20:48,083 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:48,084 INFO L158 Benchmark]: Toolchain (without parser) took 3091.38ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 72.7MB in the beginning and 82.5MB in the end (delta: -9.7MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,084 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.95ms. Allocated memory is still 142.6MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.75ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 71.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,084 INFO L158 Benchmark]: Boogie Preprocessor took 18.28ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 69.7MB in the end (delta: 876.8kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,085 INFO L158 Benchmark]: RCFGBuilder took 154.17ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 61.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,085 INFO L158 Benchmark]: BuchiAutomizer took 2877.84ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 60.7MB in the beginning and 82.5MB in the end (delta: -21.7MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,086 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.95ms. Allocated memory is still 142.6MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.75ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 71.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.28ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 69.7MB in the end (delta: 876.8kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 154.17ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 61.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2877.84ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 60.7MB in the beginning and 82.5MB in the end (delta: -21.7MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 0.8s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 2955 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 141 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT0 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: 51ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 2 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. 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 16:20:48,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...