/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 /storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:13,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:13,592 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:24:13,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:13,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:13,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:13,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:13,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:13,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:13,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:13,622 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:13,622 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:13,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:13,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:13,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:13,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:13,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:13,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:13,624 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:13,624 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:13,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:13,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:13,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:13,864 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:13,864 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:13,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl [2025-04-26 16:24:13,865 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/c2-barrier-2t.c.bpl' [2025-04-26 16:24:13,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:13,879 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:13,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:13,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:13,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:13,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,915 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:13,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:13,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:13,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:13,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:13,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:13,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:13,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:13,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:13,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/1) ... [2025-04-26 16:24:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:13,967 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:24:13,970 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:24:13,991 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:13,992 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:13,992 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:13,992 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:24:14,030 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:14,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:14,120 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:14,120 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:14,127 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:14,127 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:14,127 INFO L201 PluginConnector]: Adding new model c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:14 BoogieIcfgContainer [2025-04-26 16:24:14,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:14,128 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:14,128 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:14,131 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:14,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:14,132 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:13" (1/2) ... [2025-04-26 16:24:14,133 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38388bd9 and model type c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:14, skipping insertion in model container [2025-04-26 16:24:14,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:14,133 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:14" (2/2) ... [2025-04-26 16:24:14,134 INFO L376 chiAutomizerObserver]: Analyzing ICFG c2-barrier-2t.c.bpl [2025-04-26 16:24:14,180 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:14,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 76 flow [2025-04-26 16:24:14,224 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-26 16:24:14,225 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:14,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 16:24:14,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 76 flow [2025-04-26 16:24:14,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 66 flow [2025-04-26 16:24:14,232 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 27 transitions, 66 flow [2025-04-26 16:24:14,241 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:14,241 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:14,241 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:14,241 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:14,241 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:14,242 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:14,242 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:14,242 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:14,245 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:14,289 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 85 [2025-04-26 16:24:14,289 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:14,289 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:14,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:14,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:14,292 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:14,292 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 112 states, but on-demand construction may add more states [2025-04-26 16:24:14,297 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 85 [2025-04-26 16:24:14,297 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:14,297 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:14,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:14,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:14,301 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:14,302 INFO L754 eck$LassoCheckResult]: Loop: "[69] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[73] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:14,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 3036, now seen corresponding path program 1 times [2025-04-26 16:24:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125402144] [2025-04-26 16:24:14,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash 98374, now seen corresponding path program 1 times [2025-04-26 16:24:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928225190] [2025-04-26 16:24:14,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash 90514059, now seen corresponding path program 1 times [2025-04-26 16:24:14,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:14,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720970502] [2025-04-26 16:24:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:14,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:14,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:14,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:14,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:14,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:14,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:14,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:14,484 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,485 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:14,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:14,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,485 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,548 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,548 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,553 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:24:14,554 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:24:14,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:14,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,576 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:24:14,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,579 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:24:14,581 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:24:14,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:14,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:14,678 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:14,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:14,683 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:14,683 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:14,683 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:14,683 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:14,683 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:14,683 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,683 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:14,683 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:14,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:14,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:14,683 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:14,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:14,718 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:14,720 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,724 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:24:14,725 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:24:14,727 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:24:14,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:14,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:14,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:14,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:14,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:14,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:14,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:14,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:14,758 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:14,759 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:14,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:14,762 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:24:14,763 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:24:14,764 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:14,766 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:14,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:14,767 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:14,768 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:14,768 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1, x4) = 1*z - 1*x1 - 1*x4 Supporting invariants [] [2025-04-26 16:24:14,774 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:24:14,778 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:14,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:14,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:14,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:14,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:14,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:14,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:14,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:14,892 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:24:14,935 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:14,939 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 112 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:15,048 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 112 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 264 states and 593 transitions. Complement of second has 6 states. [2025-04-26 16:24:15,050 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:24:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:24:15,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:24:15,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:15,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:15,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:15,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:24:15,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:15,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 593 transitions. [2025-04-26 16:24:15,083 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 70 [2025-04-26 16:24:15,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 169 states and 382 transitions. [2025-04-26 16:24:15,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2025-04-26 16:24:15,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-04-26 16:24:15,089 INFO L74 IsDeterministic]: Start isDeterministic. Operand 169 states and 382 transitions. [2025-04-26 16:24:15,089 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:15,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 382 transitions. [2025-04-26 16:24:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 382 transitions. [2025-04-26 16:24:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2025-04-26 16:24:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 2.272108843537415) internal successors, (in total 334), 146 states have internal predecessors, (334), 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:24:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 334 transitions. [2025-04-26 16:24:15,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 334 transitions. [2025-04-26 16:24:15,130 INFO L438 stractBuchiCegarLoop]: Abstraction has 147 states and 334 transitions. [2025-04-26 16:24:15,131 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:15,131 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 334 transitions. [2025-04-26 16:24:15,132 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 70 [2025-04-26 16:24:15,132 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:15,132 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:15,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:15,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:15,133 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:15,133 INFO L754 eck$LassoCheckResult]: Loop: "[80] L39-->L41: Formula: (< (+ v_x5_5 v_x3_5) v_z_6) InVars {x5=v_x5_5, x3=v_x3_5, z=v_z_6} OutVars{x5=v_x5_5, x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[82] L41-->L42: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[84] L42-->L39: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-04-26 16:24:15,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 94210, now seen corresponding path program 1 times [2025-04-26 16:24:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:15,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936931198] [2025-04-26 16:24:15,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:15,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:15,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:15,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 109297, now seen corresponding path program 1 times [2025-04-26 16:24:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:15,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666366857] [2025-04-26 16:24:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:15,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:15,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1488277680, now seen corresponding path program 1 times [2025-04-26 16:24:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:15,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313305281] [2025-04-26 16:24:15,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:15,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:15,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:15,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:15,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:15,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:15,176 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:15,176 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:15,176 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:15,176 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:15,176 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:15,176 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,176 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:15,176 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:15,176 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:15,176 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:15,176 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:15,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:15,201 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:15,202 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:15,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,203 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:24:15,205 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:24:15,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:15,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:15,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:15,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,226 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:24:15,226 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:24:15,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:15,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:15,311 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:15,316 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:24:15,316 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:15,316 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:15,316 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:15,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:15,317 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:15,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:15,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:15,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:15,317 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:15,317 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:15,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:15,342 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:15,342 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:15,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,344 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:24:15,346 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:24:15,347 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:24:15,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:15,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:15,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:15,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:15,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:15,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:15,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:15,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:15,364 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:15,364 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,366 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:24:15,367 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:24:15,369 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:15,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:15,373 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:15,373 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:15,373 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:15,378 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:24:15,379 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:15,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:15,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:15,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:15,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:15,403 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:15,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:15,435 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:24:15,435 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:15,436 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 334 transitions. cyclomatic complexity: 217 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:24:15,540 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 334 transitions. cyclomatic complexity: 217. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 443 states and 1047 transitions. Complement of second has 7 states. [2025-04-26 16:24:15,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:24:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-26 16:24:15,544 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:24:15,544 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:15,545 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:24:15,545 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:15,545 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 96 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:24:15,545 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:15,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 1047 transitions. [2025-04-26 16:24:15,551 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 27 [2025-04-26 16:24:15,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 286 states and 693 transitions. [2025-04-26 16:24:15,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2025-04-26 16:24:15,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2025-04-26 16:24:15,557 INFO L74 IsDeterministic]: Start isDeterministic. Operand 286 states and 693 transitions. [2025-04-26 16:24:15,559 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:15,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 693 transitions. [2025-04-26 16:24:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 693 transitions. [2025-04-26 16:24:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2025-04-26 16:24:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 2.468503937007874) internal successors, (in total 627), 253 states have internal predecessors, (627), 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:24:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 627 transitions. [2025-04-26 16:24:15,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 627 transitions. [2025-04-26 16:24:15,577 INFO L438 stractBuchiCegarLoop]: Abstraction has 254 states and 627 transitions. [2025-04-26 16:24:15,577 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:15,577 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 627 transitions. [2025-04-26 16:24:15,580 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 27 [2025-04-26 16:24:15,580 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:15,580 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:15,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:15,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:15,581 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[72] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:15,581 INFO L754 eck$LassoCheckResult]: Loop: "[75] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[77] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[78] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 16:24:15,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 90513066, now seen corresponding path program 1 times [2025-04-26 16:24:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:15,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455302340] [2025-04-26 16:24:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:15,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:15,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:15,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:15,645 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:24:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:15,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455302340] [2025-04-26 16:24:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455302340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:15,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205830629] [2025-04-26 16:24:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:15,650 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:15,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 104331, now seen corresponding path program 1 times [2025-04-26 16:24:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:15,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412731777] [2025-04-26 16:24:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:15,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:15,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:15,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:15,675 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:15,675 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:15,675 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:15,675 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:15,675 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:15,675 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,675 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:15,675 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:15,675 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:15,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:15,676 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:15,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:15,701 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:15,701 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:15,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:15,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:15,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:15,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:15,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:24:15,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,725 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:15,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:15,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:15,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:15,816 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:15,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:15,821 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:15,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:15,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:15,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:15,821 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:15,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:15,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:15,821 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:15,821 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:15,821 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:15,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:15,851 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:15,851 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:15,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:15,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:15,856 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:24:15,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:15,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:15,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:15,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:15,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:15,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:15,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:15,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:15,871 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:15,871 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:15,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:15,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:15,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:15,874 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:15,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:15,877 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:15,877 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:15,877 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:15,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:15,884 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:15,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:15,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:15,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:15,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:15,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:15,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:15,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:15,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:24:15,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:15,949 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:24:15,950 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:24:15,950 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 627 transitions. cyclomatic complexity: 413 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:16,010 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 627 transitions. cyclomatic complexity: 413. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 544 states and 1407 transitions. Complement of second has 7 states. [2025-04-26 16:24:16,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-26 16:24:16,011 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:16,012 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:16,012 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:24:16,012 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:16,012 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 71 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:24:16,012 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:16,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 544 states and 1407 transitions. [2025-04-26 16:24:16,016 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 16:24:16,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 544 states to 364 states and 881 transitions. [2025-04-26 16:24:16,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-04-26 16:24:16,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2025-04-26 16:24:16,019 INFO L74 IsDeterministic]: Start isDeterministic. Operand 364 states and 881 transitions. [2025-04-26 16:24:16,019 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:16,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 364 states and 881 transitions. [2025-04-26 16:24:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states and 881 transitions. [2025-04-26 16:24:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 255. [2025-04-26 16:24:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 2.4352941176470586) internal successors, (in total 621), 254 states have internal predecessors, (621), 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:24:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 621 transitions. [2025-04-26 16:24:16,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 621 transitions. [2025-04-26 16:24:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:16,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:16,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:16,031 INFO L87 Difference]: Start difference. First operand 255 states and 621 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:16,055 INFO L93 Difference]: Finished difference Result 133 states and 307 transitions. [2025-04-26 16:24:16,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 307 transitions. [2025-04-26 16:24:16,056 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:24:16,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 307 transitions. [2025-04-26 16:24:16,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:24:16,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 16:24:16,057 INFO L74 IsDeterministic]: Start isDeterministic. Operand 133 states and 307 transitions. [2025-04-26 16:24:16,057 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:16,058 INFO L218 hiAutomatonCegarLoop]: Abstraction has 133 states and 307 transitions. [2025-04-26 16:24:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 307 transitions. [2025-04-26 16:24:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-04-26 16:24:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 2.308270676691729) internal successors, (in total 307), 132 states have internal predecessors, (307), 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:24:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 307 transitions. [2025-04-26 16:24:16,066 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 307 transitions. [2025-04-26 16:24:16,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:24:16,069 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 307 transitions. [2025-04-26 16:24:16,070 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:16,070 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 307 transitions. [2025-04-26 16:24:16,070 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:24:16,070 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:16,070 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:16,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:16,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:16,071 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[91] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[70] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[94] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L39-->L44: Formula: (<= v_z_7 (+ v_x5_8 v_x3_8)) InVars {x5=v_x5_8, x3=v_x3_8, z=v_z_7} OutVars{x5=v_x5_8, x3=v_x3_8, z=v_z_7} AuxVars[] AssignedVars[]" "[81] L44-->L45: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[83] L45-->L46-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:24:16,071 INFO L754 eck$LassoCheckResult]: Loop: "[86] L46-1-->L48: Formula: (< v_x1_6 v_z_8) InVars {x1=v_x1_6, z=v_z_8} OutVars{x1=v_x1_6, z=v_z_8} AuxVars[] AssignedVars[]" "[88] L48-->L46-1: Formula: (= v_x1_7 (+ v_x1_8 1)) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:16,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash -763978767, now seen corresponding path program 1 times [2025-04-26 16:24:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:16,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571508293] [2025-04-26 16:24:16,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:16,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:16,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:16,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:16,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:16,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:16,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:16,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-04-26 16:24:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:16,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509167298] [2025-04-26 16:24:16,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:16,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:16,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:16,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:16,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:16,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:16,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:16,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 255815283, now seen corresponding path program 1 times [2025-04-26 16:24:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:16,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651471442] [2025-04-26 16:24:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:16,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:16,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:16,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:16,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:16,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:24:16,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:24:16,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:16,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:16,112 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:16,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:16,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:16,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:16,112 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:16,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:16,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:16,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:16,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:16,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:16,113 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:16,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:16,125 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:16,125 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:16,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:16,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:16,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:16,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:16,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:16,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:16,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:24:16,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:16,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:16,146 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:16,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:16,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:16,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:16,213 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:16,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:16,217 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:16,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:16,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:16,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:16,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:16,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:16,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:16,218 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:16,218 INFO L132 ssoRankerPreferences]: Filename of dumped script: c2-barrier-2t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:16,218 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:16,218 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:16,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:16,236 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:16,236 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:16,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:16,239 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:16,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:16,242 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:24:16,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:16,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:16,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:16,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:16,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:16,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:16,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:16,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:16,260 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:16,260 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:16,262 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:16,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:24:16,263 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:16,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:16,267 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:16,267 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:16,267 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:16,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:24:16,273 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:16,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:16,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:16,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:16,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:16,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:16,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:16,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:16,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:16,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:16,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:16,312 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:24:16,313 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:24:16,313 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 307 transitions. cyclomatic complexity: 196 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:16,348 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 307 transitions. cyclomatic complexity: 196. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 181 states and 418 transitions. Complement of second has 6 states. [2025-04-26 16:24:16,348 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:24:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:24:16,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:24:16,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:16,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:24:16,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:16,349 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:24:16,349 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:16,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 418 transitions. [2025-04-26 16:24:16,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:16,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 0 states and 0 transitions. [2025-04-26 16:24:16,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:16,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:16,351 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:16,351 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:16,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:16,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:16,351 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:16,351 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:16,351 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:16,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:16,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:16,357 INFO L201 PluginConnector]: Adding new model c2-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:16 BoogieIcfgContainer [2025-04-26 16:24:16,358 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:16,358 INFO L158 Benchmark]: Toolchain (without parser) took 2478.92ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.0MB in the beginning and 98.6MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:16,359 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:16,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.44ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:16,359 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 84.1MB in the end (delta: 944.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:16,360 INFO L158 Benchmark]: RCFGBuilder took 186.64ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 74.8MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:24:16,361 INFO L158 Benchmark]: BuchiAutomizer took 2229.77ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 98.6MB in the end (delta: -24.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:16,361 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.44ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 84.1MB in the end (delta: 944.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 186.64ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 74.8MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2229.77ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.6MB in the beginning and 98.6MB in the end (delta: -24.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 163 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 114 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf93 smp100 dnf100 smp100 tf108 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 46ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:16,373 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...