/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:51,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:51,588 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:21:51,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:51,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:51,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:51,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:51,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:51,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:51,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:51,614 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:51,614 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:51,614 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:51,614 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:51,614 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:51,614 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:51,614 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:51,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:51,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:51,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:51,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:51,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:51,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:51,616 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:51,616 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:51,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:51,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:51,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:51,845 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:51,846 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:51,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl [2025-04-26 16:21:51,848 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl' [2025-04-26 16:21:51,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:51,870 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:51,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:51,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:51,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:51,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,900 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:51,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:51,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:51,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:51,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:51,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:51,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:51,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:51,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:51,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/1) ... [2025-04-26 16:21:51,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,952 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:21:51,957 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:21:51,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:21:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:21:51,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:21:51,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:21:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:21:51,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:21:51,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:51,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:51,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:21:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:21:51,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:21:51,980 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:21:52,016 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:52,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:52,107 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:52,107 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:52,114 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:52,114 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:52,114 INFO L201 PluginConnector]: Adding new model array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:52 BoogieIcfgContainer [2025-04-26 16:21:52,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:52,115 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:52,115 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:52,121 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:52,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:52,122 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:51" (1/2) ... [2025-04-26 16:21:52,125 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77deb873 and model type array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:52, skipping insertion in model container [2025-04-26 16:21:52,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:52,125 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:52" (2/2) ... [2025-04-26 16:21:52,126 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-eq-trans.wvr.bpl [2025-04-26 16:21:52,179 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:21:52,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 97 flow [2025-04-26 16:21:52,228 INFO L116 PetriNetUnfolderBase]: 6/32 cut-off events. [2025-04-26 16:21:52,229 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:21:52,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 6/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-04-26 16:21:52,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 97 flow [2025-04-26 16:21:52,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 82 flow [2025-04-26 16:21:52,236 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 32 transitions, 82 flow [2025-04-26 16:21:52,244 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:52,244 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:52,244 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:52,244 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:52,245 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:52,245 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:52,245 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:52,245 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:52,246 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:52,324 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 280 [2025-04-26 16:21:52,324 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,324 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:21:52,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:52,327 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:52,328 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 306 states, but on-demand construction may add more states [2025-04-26 16:21:52,336 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 280 [2025-04-26 16:21:52,336 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,336 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:21:52,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:52,341 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:21:52,341 INFO L754 eck$LassoCheckResult]: Loop: "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[88] L26-->L27: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[90] L27-->L26-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" [2025-04-26 16:21:52,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 1 times [2025-04-26 16:21:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479312632] [2025-04-26 16:21:52,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:52,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:52,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:52,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash 115255, now seen corresponding path program 1 times [2025-04-26 16:21:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933693701] [2025-04-26 16:21:52,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:52,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 103966681, now seen corresponding path program 1 times [2025-04-26 16:21:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940436289] [2025-04-26 16:21:52,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,654 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:52,654 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:52,655 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:52,655 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:52,655 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:52,655 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,655 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:52,655 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:52,655 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:52,655 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:52,655 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:52,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,790 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:52,792 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:52,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,795 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:21:52,799 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:21:52,800 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:21:52,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,837 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:21:52,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,839 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:21:52,840 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:21:52,842 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:21:52,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,866 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:21:52,867 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:21:52,869 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:21:52,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,889 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,895 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:21:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,899 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:21:52,901 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:21:52,902 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:21:52,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,922 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:21:52,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,931 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:21:52,934 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:21:52,935 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:21:52,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,968 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:52,969 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,987 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:21:52,988 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:21:52,989 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:53,005 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:21:53,005 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:53,005 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:53,006 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AB, Bn) = -1*i_AB + 1*Bn Supporting invariants [] [2025-04-26 16:21:53,011 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:21:53,013 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:53,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:21:53,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:21:53,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,083 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:21:53,126 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:21:53,128 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 306 states, but on-demand construction may add more states Second operand has 3 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:21:53,273 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 306 states, but on-demand construction may add more states. Second operand has 3 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) Result 1127 states and 4002 transitions. Complement of second has 7 states. [2025-04-26 16:21:53,275 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:21:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 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:21:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-26 16:21:53,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:21:53,287 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,287 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:53,287 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,287 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:21:53,287 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:53,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 4002 transitions. [2025-04-26 16:21:53,304 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 417 [2025-04-26 16:21:53,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 821 states and 2998 transitions. [2025-04-26 16:21:53,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 440 [2025-04-26 16:21:53,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2025-04-26 16:21:53,326 INFO L74 IsDeterministic]: Start isDeterministic. Operand 821 states and 2998 transitions. [2025-04-26 16:21:53,326 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:53,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 821 states and 2998 transitions. [2025-04-26 16:21:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states and 2998 transitions. [2025-04-26 16:21:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 500. [2025-04-26 16:21:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 500 states have (on average 3.724) internal successors, (in total 1862), 499 states have internal predecessors, (1862), 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:21:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1862 transitions. [2025-04-26 16:21:53,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 500 states and 1862 transitions. [2025-04-26 16:21:53,374 INFO L438 stractBuchiCegarLoop]: Abstraction has 500 states and 1862 transitions. [2025-04-26 16:21:53,374 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:53,374 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 500 states and 1862 transitions. [2025-04-26 16:21:53,377 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 273 [2025-04-26 16:21:53,377 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:53,377 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:53,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:53,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:53,378 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:53,378 INFO L754 eck$LassoCheckResult]: Loop: "[89] L26-->L31: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[91] L31-->L26-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:53,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 108183, now seen corresponding path program 1 times [2025-04-26 16:21:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701089557] [2025-04-26 16:21:53,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash 118227, now seen corresponding path program 1 times [2025-04-26 16:21:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112735017] [2025-04-26 16:21:53,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,422 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:21:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:53,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112735017] [2025-04-26 16:21:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112735017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:53,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:21:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946750257] [2025-04-26 16:21:53,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:53,426 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:21:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:53,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:21:53,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:21:53,428 INFO L87 Difference]: Start difference. First operand 500 states and 1862 transitions. cyclomatic complexity: 1412 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 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:21:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:53,464 INFO L93 Difference]: Finished difference Result 698 states and 2428 transitions. [2025-04-26 16:21:53,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 2428 transitions. [2025-04-26 16:21:53,473 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 396 [2025-04-26 16:21:53,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 580 states and 2042 transitions. [2025-04-26 16:21:53,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 425 [2025-04-26 16:21:53,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 425 [2025-04-26 16:21:53,480 INFO L74 IsDeterministic]: Start isDeterministic. Operand 580 states and 2042 transitions. [2025-04-26 16:21:53,480 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:53,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 580 states and 2042 transitions. [2025-04-26 16:21:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states and 2042 transitions. [2025-04-26 16:21:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 466. [2025-04-26 16:21:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 466 states have (on average 3.6609442060085837) internal successors, (in total 1706), 465 states have internal predecessors, (1706), 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:21:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1706 transitions. [2025-04-26 16:21:53,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 466 states and 1706 transitions. [2025-04-26 16:21:53,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:21:53,503 INFO L438 stractBuchiCegarLoop]: Abstraction has 466 states and 1706 transitions. [2025-04-26 16:21:53,503 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:53,503 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 466 states and 1706 transitions. [2025-04-26 16:21:53,508 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2025-04-26 16:21:53,508 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:53,508 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:53,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:53,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:53,509 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L71-1-->L41-2: 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:21:53,509 INFO L754 eck$LassoCheckResult]: Loop: "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" "[95] L41-->L42: Formula: (= (select v_C_1 v_i_BC_2) (select v_B_3 v_i_BC_2)) InVars {i_BC=v_i_BC_2, C=v_C_1, B=v_B_3} OutVars{i_BC=v_i_BC_2, C=v_C_1, B=v_B_3} AuxVars[] AssignedVars[]" "[97] L42-->L41-2: Formula: (= (+ v_i_BC_4 1) v_i_BC_3) InVars {i_BC=v_i_BC_4} OutVars{i_BC=v_i_BC_3} AuxVars[] AssignedVars[i_BC]" [2025-04-26 16:21:53,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 108208, now seen corresponding path program 1 times [2025-04-26 16:21:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493483764] [2025-04-26 16:21:53,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 122206, now seen corresponding path program 1 times [2025-04-26 16:21:53,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492285012] [2025-04-26 16:21:53,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1071250353, now seen corresponding path program 1 times [2025-04-26 16:21:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:53,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117382191] [2025-04-26 16:21:53,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:53,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:53,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:53,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:53,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:53,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:53,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:53,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:53,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,656 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:53,656 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:53,656 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:53,656 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:53,656 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:53,656 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,656 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:53,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:53,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:53,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:53,656 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:53,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,771 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:53,771 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:53,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,778 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:21:53,780 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:21:53,781 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:21:53,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,796 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,804 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:21:53,804 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:21:53,807 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:21:53,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,822 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:53,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,829 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:21:53,829 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:21:53,830 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:21:53,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,845 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,851 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:21:53,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,854 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:21:53,855 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:21:53,857 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:21:53,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,887 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:21:53,896 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:21:53,898 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:21:53,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:53,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:53,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:53,927 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:21:53,927 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:53,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,929 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:21:53,930 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:21:53,931 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:53,946 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:21:53,947 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:53,947 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:53,947 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(Bn, i_BC) = 1*Bn - 1*i_BC Supporting invariants [] [2025-04-26 16:21:53,953 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:21:53,954 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:53,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:53,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:53,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:54,011 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:21:54,012 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:21:54,012 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 466 states and 1706 transitions. cyclomatic complexity: 1297 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:54,086 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 466 states and 1706 transitions. cyclomatic complexity: 1297. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1727 states and 6623 transitions. Complement of second has 6 states. [2025-04-26 16:21:54,086 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:21:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 16:21:54,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:21:54,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:21:54,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:21:54,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1727 states and 6623 transitions. [2025-04-26 16:21:54,105 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 365 [2025-04-26 16:21:54,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1727 states to 1399 states and 5375 transitions. [2025-04-26 16:21:54,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2025-04-26 16:21:54,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 696 [2025-04-26 16:21:54,121 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1399 states and 5375 transitions. [2025-04-26 16:21:54,121 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:54,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1399 states and 5375 transitions. [2025-04-26 16:21:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states and 5375 transitions. [2025-04-26 16:21:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 947. [2025-04-26 16:21:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 947 states have (on average 3.972544878563886) internal successors, (in total 3762), 946 states have internal predecessors, (3762), 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:21:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 3762 transitions. [2025-04-26 16:21:54,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 947 states and 3762 transitions. [2025-04-26 16:21:54,147 INFO L438 stractBuchiCegarLoop]: Abstraction has 947 states and 3762 transitions. [2025-04-26 16:21:54,147 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:54,148 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 947 states and 3762 transitions. [2025-04-26 16:21:54,153 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 265 [2025-04-26 16:21:54,153 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:54,153 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:54,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:54,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:54,154 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L71-1-->L41-2: 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]" "[114] L72-->L56-2: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:21:54,154 INFO L754 eck$LassoCheckResult]: Loop: "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" "[103] L56-->L61: Formula: (not (= (select v_A_5 v_i_AC_8) (select v_C_5 v_i_AC_8))) InVars {A=v_A_5, i_AC=v_i_AC_8, C=v_C_5} OutVars{A=v_A_5, i_AC=v_i_AC_8, C=v_C_5} AuxVars[] AssignedVars[]" "[105] L61-->L56-2: Formula: v_break_AC_2 InVars {} OutVars{break_AC=v_break_AC_2} AuxVars[] AssignedVars[break_AC]" [2025-04-26 16:21:54,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash 3354562, now seen corresponding path program 1 times [2025-04-26 16:21:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107530159] [2025-04-26 16:21:54,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:54,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:54,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:54,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:54,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash 129189, now seen corresponding path program 1 times [2025-04-26 16:21:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841234204] [2025-04-26 16:21:54,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:54,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:54,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1151608132, now seen corresponding path program 1 times [2025-04-26 16:21:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236264519] [2025-04-26 16:21:54,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:54,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:54,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:54,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:54,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,309 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:54,309 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:54,309 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:54,309 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:54,309 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:54,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:54,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:54,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:21:54,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:54,309 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:54,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,441 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:54,441 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:54,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,446 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:21:54,461 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:21:54,462 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:21:54,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,477 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,486 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:21:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,488 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:21:54,489 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:21:54,491 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:21:54,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,505 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,511 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:21:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,513 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:21:54,514 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:21:54,516 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:21:54,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,530 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,536 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:21:54,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,539 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:21:54,540 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:21:54,541 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:21:54,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,555 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:54,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,564 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:54,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:21:54,566 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:21:54,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:54,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:54,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:54,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:54,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:54,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:54,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:54,584 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:21:54,584 INFO L437 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:21:54,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:54,586 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:54,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:21:54,588 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:54,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:21:54,605 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:54,605 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:54,605 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_AC 1 0)_3) = -2*v_rep(ite break_AC 1 0)_3 + 1 Supporting invariants [] [2025-04-26 16:21:54,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:54,612 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:54,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:54,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:54,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:54,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:54,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:54,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:54,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:54,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:54,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:54,660 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:21:54,661 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:21:54,661 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 947 states and 3762 transitions. cyclomatic complexity: 2917 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:54,739 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 947 states and 3762 transitions. cyclomatic complexity: 2917. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3482 states and 14187 transitions. Complement of second has 6 states. [2025-04-26 16:21:54,740 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:21:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:21:54,742 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:21:54,742 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,742 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:21:54,742 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,742 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:21:54,742 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3482 states and 14187 transitions. [2025-04-26 16:21:54,779 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 312 [2025-04-26 16:21:54,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3482 states to 2777 states and 11393 transitions. [2025-04-26 16:21:54,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 780 [2025-04-26 16:21:54,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 902 [2025-04-26 16:21:54,811 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2777 states and 11393 transitions. [2025-04-26 16:21:54,811 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:54,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2777 states and 11393 transitions. [2025-04-26 16:21:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states and 11393 transitions. [2025-04-26 16:21:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 1972. [2025-04-26 16:21:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1972 states have (on average 4.226166328600406) internal successors, (in total 8334), 1971 states have internal predecessors, (8334), 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:21:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 8334 transitions. [2025-04-26 16:21:54,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1972 states and 8334 transitions. [2025-04-26 16:21:54,905 INFO L438 stractBuchiCegarLoop]: Abstraction has 1972 states and 8334 transitions. [2025-04-26 16:21:54,905 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:54,905 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1972 states and 8334 transitions. [2025-04-26 16:21:54,917 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 240 [2025-04-26 16:21:54,917 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:54,917 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:54,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:54,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:54,918 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L71-1-->L41-2: 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]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" [2025-04-26 16:21:54,918 INFO L754 eck$LassoCheckResult]: Loop: "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" "[96] L41-->L46: Formula: (not (= (select v_B_4 v_i_BC_5) (select v_C_2 v_i_BC_5))) InVars {i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} OutVars{i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} AuxVars[] AssignedVars[]" "[98] L46-->L41-2: Formula: v_break_BC_2 InVars {} OutVars{break_BC=v_break_BC_2} AuxVars[] AssignedVars[break_BC]" [2025-04-26 16:21:54,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash 3354533, now seen corresponding path program 1 times [2025-04-26 16:21:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726486482] [2025-04-26 16:21:54,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:54,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:54,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:54,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:54,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 122238, now seen corresponding path program 1 times [2025-04-26 16:21:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201661556] [2025-04-26 16:21:54,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:54,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:54,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:54,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:54,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1150737242, now seen corresponding path program 1 times [2025-04-26 16:21:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277999164] [2025-04-26 16:21:54,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:54,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:54,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:54,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:54,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:55,062 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:55,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:55,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:55,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:55,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:55,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:55,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:55,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:21:55,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:55,062 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:55,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,165 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:55,165 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:55,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,168 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:55,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:21:55,170 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:21:55,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:55,188 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:21:55,188 INFO L437 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:21:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,190 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:55,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:21:55,191 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:55,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:21:55,208 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:55,208 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:55,208 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_BC 1 0)_4) = -2*v_rep(ite break_BC 1 0)_4 + 1 Supporting invariants [] [2025-04-26 16:21:55,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:21:55,215 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:55,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:55,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:55,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:55,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:55,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:55,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:55,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:55,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:55,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:55,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:55,250 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:21:55,250 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:21:55,251 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1972 states and 8334 transitions. cyclomatic complexity: 6536 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:55,349 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1972 states and 8334 transitions. cyclomatic complexity: 6536. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4864 states and 19688 transitions. Complement of second has 6 states. [2025-04-26 16:21:55,349 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:21:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:21:55,350 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:21:55,350 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:55,350 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:21:55,350 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:55,350 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:21:55,350 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:55,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4864 states and 19688 transitions. [2025-04-26 16:21:55,394 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 264 [2025-04-26 16:21:55,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4864 states to 3901 states and 15738 transitions. [2025-04-26 16:21:55,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 785 [2025-04-26 16:21:55,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 850 [2025-04-26 16:21:55,454 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3901 states and 15738 transitions. [2025-04-26 16:21:55,454 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:55,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3901 states and 15738 transitions. [2025-04-26 16:21:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states and 15738 transitions. [2025-04-26 16:21:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 2985. [2025-04-26 16:21:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2985 states have (on average 4.165829145728643) internal successors, (in total 12435), 2984 states have internal predecessors, (12435), 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:21:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 12435 transitions. [2025-04-26 16:21:55,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2985 states and 12435 transitions. [2025-04-26 16:21:55,530 INFO L438 stractBuchiCegarLoop]: Abstraction has 2985 states and 12435 transitions. [2025-04-26 16:21:55,530 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:21:55,531 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2985 states and 12435 transitions. [2025-04-26 16:21:55,549 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 225 [2025-04-26 16:21:55,549 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:55,549 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:55,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:55,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:55,550 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L71-1-->L41-2: 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]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:55,550 INFO L754 eck$LassoCheckResult]: Loop: "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" "[96] L41-->L46: Formula: (not (= (select v_B_4 v_i_BC_5) (select v_C_2 v_i_BC_5))) InVars {i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} OutVars{i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} AuxVars[] AssignedVars[]" "[98] L46-->L41-2: Formula: v_break_BC_2 InVars {} OutVars{break_BC=v_break_BC_2} AuxVars[] AssignedVars[break_BC]" [2025-04-26 16:21:55,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash 3354534, now seen corresponding path program 1 times [2025-04-26 16:21:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:55,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411135483] [2025-04-26 16:21:55,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:55,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:55,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:55,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:55,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:55,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:55,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:55,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:55,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:55,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 122238, now seen corresponding path program 2 times [2025-04-26 16:21:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:55,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223463748] [2025-04-26 16:21:55,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:55,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:55,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:55,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:55,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:55,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:55,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:55,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:55,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:55,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:55,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1150767033, now seen corresponding path program 1 times [2025-04-26 16:21:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:55,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908080627] [2025-04-26 16:21:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:55,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:55,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:55,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:55,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:55,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:55,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:55,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:55,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:55,667 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:55,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:55,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:55,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:55,668 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:55,668 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,668 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:55,668 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:55,668 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:21:55,668 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:55,668 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:55,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,777 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:55,778 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,781 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:55,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:21:55,784 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:21:55,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,795 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:55,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,795 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:21:55,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,796 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:21:55,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,804 INFO L229 MonitoredProcess]: Starting monitored process 23 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:21:55,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:21:55,806 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:21:55,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,821 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:21:55,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,829 INFO L229 MonitoredProcess]: Starting monitored process 24 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:21:55,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:21:55,833 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:21:55,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,847 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,854 INFO L229 MonitoredProcess]: Starting monitored process 25 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:21:55,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:21:55,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:21:55,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,873 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,884 INFO L229 MonitoredProcess]: Starting monitored process 26 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:21:55,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:21:55,887 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:21:55,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,901 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,909 INFO L229 MonitoredProcess]: Starting monitored process 27 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:21:55,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:21:55,912 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:21:55,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,925 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:21:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,933 INFO L229 MonitoredProcess]: Starting monitored process 28 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:21:55,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:21:55,936 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:21:55,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,949 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,960 INFO L229 MonitoredProcess]: Starting monitored process 29 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:21:55,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:21:55,962 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:21:55,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,976 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,983 INFO L229 MonitoredProcess]: Starting monitored process 30 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:21:55,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:21:55,986 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:21:55,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:56,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:56,005 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:21:56,005 INFO L437 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:21:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:56,007 INFO L229 MonitoredProcess]: Starting monitored process 31 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:21:56,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:21:56,010 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:56,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:21:56,026 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:56,026 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:56,026 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_BC 1 0)_5) = -2*v_rep(ite break_BC 1 0)_5 + 1 Supporting invariants [] [2025-04-26 16:21:56,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:56,033 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:56,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:56,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:56,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:56,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:56,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:56,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:56,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:56,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:56,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:56,064 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:21:56,065 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:21:56,065 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2985 states and 12435 transitions. cyclomatic complexity: 9733 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:56,294 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2985 states and 12435 transitions. cyclomatic complexity: 9733. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 15996 states and 67467 transitions. Complement of second has 6 states. [2025-04-26 16:21:56,295 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:21:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 16:21:56,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:21:56,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:21:56,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:21:56,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15996 states and 67467 transitions. [2025-04-26 16:21:56,484 INFO L131 ngComponentsAnalysis]: Automaton has 137 accepting balls. 417 [2025-04-26 16:21:56,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15996 states to 10733 states and 43773 transitions. [2025-04-26 16:21:56,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1886 [2025-04-26 16:21:56,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2038 [2025-04-26 16:21:56,610 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10733 states and 43773 transitions. [2025-04-26 16:21:56,610 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:56,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10733 states and 43773 transitions. [2025-04-26 16:21:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10733 states and 43773 transitions. [2025-04-26 16:21:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10733 to 5414. [2025-04-26 16:21:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5414 states, 5414 states have (on average 4.361654968599926) internal successors, (in total 23614), 5413 states have internal predecessors, (23614), 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:21:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 23614 transitions. [2025-04-26 16:21:56,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5414 states and 23614 transitions. [2025-04-26 16:21:56,798 INFO L438 stractBuchiCegarLoop]: Abstraction has 5414 states and 23614 transitions. [2025-04-26 16:21:56,798 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:21:56,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5414 states and 23614 transitions. [2025-04-26 16:21:56,834 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 216 [2025-04-26 16:21:56,834 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:56,834 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:56,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:56,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:56,835 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L71-1-->L41-2: 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]" "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:56,835 INFO L754 eck$LassoCheckResult]: Loop: "[96] L41-->L46: Formula: (not (= (select v_B_4 v_i_BC_5) (select v_C_2 v_i_BC_5))) InVars {i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} OutVars{i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} AuxVars[] AssignedVars[]" "[98] L46-->L41-2: Formula: v_break_BC_2 InVars {} OutVars{break_BC=v_break_BC_2} AuxVars[] AssignedVars[break_BC]" "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" [2025-04-26 16:21:56,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 3354541, now seen corresponding path program 1 times [2025-04-26 16:21:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137620287] [2025-04-26 16:21:56,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:56,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:56,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:56,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:56,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 125178, now seen corresponding path program 3 times [2025-04-26 16:21:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544499608] [2025-04-26 16:21:56,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:21:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:56,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:56,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:21:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:56,853 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:21:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:56,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544499608] [2025-04-26 16:21:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544499608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:21:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752047458] [2025-04-26 16:21:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:56,853 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:21:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:56,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:21:56,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:21:56,854 INFO L87 Difference]: Start difference. First operand 5414 states and 23614 transitions. cyclomatic complexity: 18708 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 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:21:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:56,924 INFO L93 Difference]: Finished difference Result 6458 states and 26234 transitions. [2025-04-26 16:21:56,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6458 states and 26234 transitions. [2025-04-26 16:21:56,984 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 282 [2025-04-26 16:21:57,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6458 states to 4572 states and 18284 transitions. [2025-04-26 16:21:57,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1134 [2025-04-26 16:21:57,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1158 [2025-04-26 16:21:57,030 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4572 states and 18284 transitions. [2025-04-26 16:21:57,030 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:57,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4572 states and 18284 transitions. [2025-04-26 16:21:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states and 18284 transitions. [2025-04-26 16:21:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 3393. [2025-04-26 16:21:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3393 states have (on average 4.135278514588859) internal successors, (in total 14031), 3392 states have internal predecessors, (14031), 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:21:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 14031 transitions. [2025-04-26 16:21:57,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3393 states and 14031 transitions. [2025-04-26 16:21:57,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:21:57,127 INFO L438 stractBuchiCegarLoop]: Abstraction has 3393 states and 14031 transitions. [2025-04-26 16:21:57,127 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:21:57,127 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3393 states and 14031 transitions. [2025-04-26 16:21:57,144 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 222 [2025-04-26 16:21:57,144 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:57,144 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:57,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:57,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:21:57,145 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[111] L71-1-->L41-2: 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]" "[114] L72-->L56-2: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" [2025-04-26 16:21:57,145 INFO L754 eck$LassoCheckResult]: Loop: "[102] L56-->L57: Formula: (= (select v_A_4 v_i_AC_5) (select v_C_4 v_i_AC_5)) InVars {A=v_A_4, i_AC=v_i_AC_5, C=v_C_4} OutVars{A=v_A_4, i_AC=v_i_AC_5, C=v_C_4} AuxVars[] AssignedVars[]" "[104] L57-->L56-2: Formula: (= v_i_AC_6 (+ v_i_AC_7 1)) InVars {i_AC=v_i_AC_7} OutVars{i_AC=v_i_AC_6} AuxVars[] AssignedVars[i_AC]" "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" [2025-04-26 16:21:57,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 103991522, now seen corresponding path program 1 times [2025-04-26 16:21:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:57,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448866557] [2025-04-26 16:21:57,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:57,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:57,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:57,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:57,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:57,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:57,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:57,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 131137, now seen corresponding path program 1 times [2025-04-26 16:21:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:57,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189691155] [2025-04-26 16:21:57,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:57,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:57,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:57,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:57,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:57,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:57,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:57,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1340112832, now seen corresponding path program 1 times [2025-04-26 16:21:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:57,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876976154] [2025-04-26 16:21:57,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:57,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:57,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:57,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:57,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:57,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:57,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:57,326 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:57,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:57,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:57,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:57,327 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:57,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:57,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:57,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:21:57,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:57,327 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:57,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:57,430 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:57,430 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:57,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,432 INFO L229 MonitoredProcess]: Starting monitored process 32 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:21:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:21:57,435 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:21:57,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,448 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,455 INFO L229 MonitoredProcess]: Starting monitored process 33 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:21:57,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:21:57,457 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:21:57,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,470 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:21:57,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,477 INFO L229 MonitoredProcess]: Starting monitored process 34 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:21:57,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:21:57,479 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:21:57,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,492 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:21:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,500 INFO L229 MonitoredProcess]: Starting monitored process 35 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:21:57,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:21:57,502 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:21:57,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,515 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:21:57,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,523 INFO L229 MonitoredProcess]: Starting monitored process 36 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:21:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:21:57,526 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:21:57,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,539 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:21:57,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,548 INFO L229 MonitoredProcess]: Starting monitored process 37 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:21:57,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:21:57,551 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:21:57,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,565 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,573 INFO L229 MonitoredProcess]: Starting monitored process 38 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:21:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:21:57,575 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:21:57,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,589 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,597 INFO L229 MonitoredProcess]: Starting monitored process 39 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:21:57,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:21:57,599 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:21:57,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,612 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,620 INFO L229 MonitoredProcess]: Starting monitored process 40 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:21:57,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:21:57,622 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:21:57,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,634 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:21:57,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,641 INFO L229 MonitoredProcess]: Starting monitored process 41 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:21:57,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:21:57,643 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:21:57,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:57,663 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:57,664 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,665 INFO L229 MonitoredProcess]: Starting monitored process 42 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:21:57,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:21:57,667 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:57,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:21:57,682 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:57,682 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:57,683 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(An, i_AC) = 1*An - 1*i_AC Supporting invariants [] [2025-04-26 16:21:57,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:21:57,689 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:57,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:57,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:57,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:57,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:57,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:57,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:57,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:57,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:57,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:57,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:57,733 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:21:57,734 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:21:57,734 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3393 states and 14031 transitions. cyclomatic complexity: 10981 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:21:57,830 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3393 states and 14031 transitions. cyclomatic complexity: 10981. 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 12152 states and 50387 transitions. Complement of second has 6 states. [2025-04-26 16:21:57,831 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:21:57,831 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:21:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-26 16:21:57,832 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:21:57,832 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,832 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:21:57,832 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,832 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:21:57,832 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12152 states and 50387 transitions. [2025-04-26 16:21:57,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:57,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12152 states to 0 states and 0 transitions. [2025-04-26 16:21:57,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:57,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:57,907 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:57,907 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:57,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:57,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:57,908 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:57,908 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:21:57,908 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:57,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:57,908 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:57,912 INFO L201 PluginConnector]: Adding new model array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:57 BoogieIcfgContainer [2025-04-26 16:21:57,912 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:57,913 INFO L158 Benchmark]: Toolchain (without parser) took 6043.34ms. Allocated memory was 167.8MB in the beginning and 415.2MB in the end (delta: 247.5MB). Free memory was 93.8MB in the beginning and 132.6MB in the end (delta: -38.7MB). Peak memory consumption was 211.7MB. Max. memory is 8.0GB. [2025-04-26 16:21:57,913 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.90ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:57,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 92.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:57,913 INFO L158 Benchmark]: Boogie Preprocessor took 24.14ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 90.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:57,914 INFO L158 Benchmark]: RCFGBuilder took 187.92ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 80.9MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:21:57,914 INFO L158 Benchmark]: BuchiAutomizer took 5797.39ms. Allocated memory was 167.8MB in the beginning and 415.2MB in the end (delta: 247.5MB). Free memory was 80.7MB in the beginning and 132.6MB in the end (delta: -51.9MB). Peak memory consumption was 199.1MB. Max. memory is 8.0GB. [2025-04-26 16:21:57,914 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.90ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 92.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.14ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 90.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 187.92ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 80.9MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5797.39ms. Allocated memory was 167.8MB in the beginning and 415.2MB in the end (delta: 247.5MB). Free memory was 80.7MB in the beginning and 132.6MB in the end (delta: -51.9MB). Peak memory consumption was 199.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 9106 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 386 mSDsluCounter, 621 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 330 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital53 mio100 ax100 hnf100 lsp50 ukn85 mio100 lsp84 div100 bol100 ite100 ukn100 eq135 hnf96 smp100 dnf104 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_AB + Bn and consists of 5 locations. One deterministic module has affine ranking function Bn + -1 * i_BC and consists of 4 locations. One deterministic module has affine ranking function -2 * (if break_AC then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * (if break_BC then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * (if break_BC then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_AC + An and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:21:57,927 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...