/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/popl20-more/parray-copy.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:25,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:25,838 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:23:25,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:25,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:25,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:25,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:25,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:25,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:25,864 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:25,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:25,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:25,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:25,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:25,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:25,865 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:25,866 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:26,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:26,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:26,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:26,184 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:26,185 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:26,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl [2025-04-26 16:23:26,188 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl' [2025-04-26 16:23:26,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:26,206 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:26,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:26,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:26,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:26,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,241 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:26,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:26,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:26,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:26,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:26,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:26,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:26,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:26,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:26,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/1) ... [2025-04-26 16:23:26,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:26,295 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:23:26,298 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:23:26,318 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:26,318 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:26,318 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:26,319 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:26,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:26,319 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:23:26,355 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:26,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:26,433 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:26,433 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:26,447 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:26,447 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:26,447 INFO L201 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:26 BoogieIcfgContainer [2025-04-26 16:23:26,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:26,448 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:26,448 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:26,452 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:26,452 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:26,452 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:26" (1/2) ... [2025-04-26 16:23:26,453 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ebfb71 and model type parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:26, skipping insertion in model container [2025-04-26 16:23:26,453 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:26,453 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:26" (2/2) ... [2025-04-26 16:23:26,454 INFO L376 chiAutomizerObserver]: Analyzing ICFG parray-copy.wvr.bpl [2025-04-26 16:23:26,500 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:26,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 89 flow [2025-04-26 16:23:26,550 INFO L116 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-04-26 16:23:26,551 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:26,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-26 16:23:26,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 34 transitions, 89 flow [2025-04-26 16:23:26,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2025-04-26 16:23:26,557 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 28 transitions, 74 flow [2025-04-26 16:23:26,566 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:26,568 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:26,568 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:26,568 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:26,568 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:26,568 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:26,568 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:26,568 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:26,569 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:26,627 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:23:26,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:26,627 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:26,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:26,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:26,631 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:26,632 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 115 states, but on-demand construction may add more states [2025-04-26 16:23:26,640 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:23:26,640 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:26,640 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:26,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:26,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:26,647 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:26,648 INFO L754 eck$LassoCheckResult]: Loop: "[72] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L22-->L22-1: Formula: (and (= (store v_B_9 v_i_8 (select v_A_5 v_i_8)) v_B_8) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_5, i=v_i_8, B=v_B_9} OutVars{A=v_A_5, i=v_i_7, B=v_B_8} AuxVars[] AssignedVars[i, B]" [2025-04-26 16:23:26,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1427095415, now seen corresponding path program 1 times [2025-04-26 16:23:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:26,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905550069] [2025-04-26 16:23:26,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:26,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:26,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:26,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:26,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:26,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:26,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:26,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:26,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:26,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:26,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:23:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:26,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159426862] [2025-04-26 16:23:26,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:26,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:26,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:26,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:26,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:26,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:26,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:26,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:26,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:26,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1344124085, now seen corresponding path program 1 times [2025-04-26 16:23:26,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:26,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848770671] [2025-04-26 16:23:26,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:26,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:26,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:26,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:26,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:26,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:26,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:26,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:26,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:26,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:26,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:26,878 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:26,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:26,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:26,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:26,881 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:26,881 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:26,881 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:26,881 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:26,881 INFO L132 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:26,881 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:26,881 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:26,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:26,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:26,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,027 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:27,030 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:27,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,033 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:23:27,035 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:23:27,036 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:23:27,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,088 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:27,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:27,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,099 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:23:27,101 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:23:27,103 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:23:27,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:27,139 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:27,140 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:23:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,147 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:23:27,149 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:23:27,149 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:27,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:23:27,171 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:27,171 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:27,171 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:23:27,179 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:23:27,182 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:27,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:27,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:27,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:27,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:27,282 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:23:27,323 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:23:27,330 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 115 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:27,460 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 115 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 303 states and 948 transitions. Complement of second has 7 states. [2025-04-26 16:23:27,464 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:23:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-26 16:23:27,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:27,474 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:27,474 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:23:27,474 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:27,474 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:23:27,474 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:27,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 948 transitions. [2025-04-26 16:23:27,485 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 70 [2025-04-26 16:23:27,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 187 states and 591 transitions. [2025-04-26 16:23:27,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2025-04-26 16:23:27,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2025-04-26 16:23:27,493 INFO L74 IsDeterministic]: Start isDeterministic. Operand 187 states and 591 transitions. [2025-04-26 16:23:27,493 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:27,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 591 transitions. [2025-04-26 16:23:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 591 transitions. [2025-04-26 16:23:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 139. [2025-04-26 16:23:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 3.2158273381294964) internal successors, (in total 447), 138 states have internal predecessors, (447), 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:23:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 447 transitions. [2025-04-26 16:23:27,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 139 states and 447 transitions. [2025-04-26 16:23:27,527 INFO L438 stractBuchiCegarLoop]: Abstraction has 139 states and 447 transitions. [2025-04-26 16:23:27,527 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:27,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 447 transitions. [2025-04-26 16:23:27,530 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 70 [2025-04-26 16:23:27,530 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:27,530 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:27,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:27,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:27,533 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[88] L60-1-->L33-1: 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:23:27,534 INFO L754 eck$LassoCheckResult]: Loop: "[76] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[78] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (store v_B_13 v_j_8 (select v_A_7 v_j_8)) v_B_12)) InVars {A=v_A_7, j=v_j_8, B=v_B_13} OutVars{A=v_A_7, j=v_j_7, B=v_B_12} AuxVars[] AssignedVars[j, B]" [2025-04-26 16:23:27,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1290284817, now seen corresponding path program 1 times [2025-04-26 16:23:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137971709] [2025-04-26 16:23:27,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:27,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:27,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:27,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:27,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:23:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651325081] [2025-04-26 16:23:27,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:27,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:27,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:27,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:27,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1281841841, now seen corresponding path program 1 times [2025-04-26 16:23:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:27,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681955038] [2025-04-26 16:23:27,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:27,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:27,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:27,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:27,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:27,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:27,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:27,663 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:27,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:27,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:27,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:27,663 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:27,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:27,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:27,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:27,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:27,663 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:27,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:27,762 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:27,763 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:27,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,765 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:23:27,767 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:23:27,768 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:23:27,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,790 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:27,796 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:23:27,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,798 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:23:27,799 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:23:27,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:27,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:27,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:23:27,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,824 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:23:27,825 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:23:27,826 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:23:27,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:27,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:27,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:27,839 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:27,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:27,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,847 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:23:27,848 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:23:27,849 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:23:27,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:27,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:27,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:27,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:27,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:23:27,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,871 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:23:27,871 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:23:27,874 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:23:27,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:27,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:27,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:27,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:27,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:27,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:27,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:27,915 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:27,915 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:23:27,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:27,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:27,918 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:23:27,919 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:23:27,920 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:27,937 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:23:27,938 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:27,938 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:27,938 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:23:27,944 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:23:27,945 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:27,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:27,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:27,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:27,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:27,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:27,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:27,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:27,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:27,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,001 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:23:28,001 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:23:28,001 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 447 transitions. cyclomatic complexity: 347 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,048 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 447 transitions. cyclomatic complexity: 347. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 411 states and 1406 transitions. Complement of second has 6 states. [2025-04-26 16:23:28,049 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:23:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-04-26 16:23:28,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:23:28,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:28,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:23:28,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 1406 transitions. [2025-04-26 16:23:28,057 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:23:28,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 233 states and 793 transitions. [2025-04-26 16:23:28,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-04-26 16:23:28,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2025-04-26 16:23:28,065 INFO L74 IsDeterministic]: Start isDeterministic. Operand 233 states and 793 transitions. [2025-04-26 16:23:28,065 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:28,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 793 transitions. [2025-04-26 16:23:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 793 transitions. [2025-04-26 16:23:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2025-04-26 16:23:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 192 states have (on average 3.546875) internal successors, (in total 681), 191 states have internal predecessors, (681), 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:23:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 681 transitions. [2025-04-26 16:23:28,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 192 states and 681 transitions. [2025-04-26 16:23:28,082 INFO L438 stractBuchiCegarLoop]: Abstraction has 192 states and 681 transitions. [2025-04-26 16:23:28,082 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:28,082 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 681 transitions. [2025-04-26 16:23:28,083 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:23:28,083 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:28,083 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:28,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:28,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:28,084 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[88] L60-1-->L33-1: 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]" "[91] L61-->L44-1: 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:23:28,084 INFO L754 eck$LassoCheckResult]: Loop: "[80] L44-1-->L44: Formula: (< v_k_2 v_N_5) InVars {k=v_k_2, N=v_N_5} OutVars{k=v_k_2, N=v_N_5} AuxVars[] AssignedVars[]" "[82] L44-->L44-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (store v_B_17 v_k_8 (select v_A_9 v_k_8)) v_B_16)) InVars {A=v_A_9, k=v_k_8, B=v_B_17} OutVars{A=v_A_9, k=v_k_7, B=v_B_16} AuxVars[] AssignedVars[k, B]" [2025-04-26 16:23:28,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1344123572, now seen corresponding path program 1 times [2025-04-26 16:23:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249674383] [2025-04-26 16:23:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:28,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:28,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:28,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 16:23:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384017607] [2025-04-26 16:23:28,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:28,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:28,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:28,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:28,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1082405966, now seen corresponding path program 1 times [2025-04-26 16:23:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:28,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369417262] [2025-04-26 16:23:28,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:28,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:28,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:28,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:28,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:28,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:28,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:28,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:28,222 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:28,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:28,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:28,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:28,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:28,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:28,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:28,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:28,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:28,222 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:28,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:28,350 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:28,350 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:28,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,357 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:23:28,358 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:23:28,359 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:23:28,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,375 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:23:28,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,384 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:23:28,385 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:23:28,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:28,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,402 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,408 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:23:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,411 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:23:28,412 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:23:28,413 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:23:28,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,427 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,433 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:23:28,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,438 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:23:28,440 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:23:28,441 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:23:28,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,456 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,462 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:23:28,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,465 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:23:28,466 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:23:28,468 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:23:28,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:23:28,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,490 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:23:28,491 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:23:28,492 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:23:28,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,506 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,511 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:23:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,513 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:23:28,514 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:23:28,515 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:23:28,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:23:28,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,541 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:23:28,542 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:23:28,549 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:23:28,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,566 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:28,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:23:28,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,573 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:23:28,575 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:23:28,576 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:23:28,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:28,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:28,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:28,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:28,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:28,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:28,593 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:28,602 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:28,603 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:28,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:28,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:28,605 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:23:28,606 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:23:28,607 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:28,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,624 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:28,624 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:28,624 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2025-04-26 16:23:28,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:28,631 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:28,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:28,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:28,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:28,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:28,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:28,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:28,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:28,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:28,680 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:23:28,680 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:23:28,681 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 681 transitions. cyclomatic complexity: 530 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,732 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 681 transitions. cyclomatic complexity: 530. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 509 states and 1782 transitions. Complement of second has 6 states. [2025-04-26 16:23:28,733 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:23:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 16:23:28,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:23:28,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:23:28,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:23:28,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:28,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 509 states and 1782 transitions. [2025-04-26 16:23:28,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:28,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 509 states to 0 states and 0 transitions. [2025-04-26 16:23:28,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:28,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:28,740 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:28,740 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:28,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:28,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:28,740 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:28,740 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:28,740 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:28,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:28,740 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:28,745 INFO L201 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:28 BoogieIcfgContainer [2025-04-26 16:23:28,745 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:28,745 INFO L158 Benchmark]: Toolchain (without parser) took 2539.00ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.6MB in the beginning and 94.8MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:28,746 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:28,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.07ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:28,746 INFO L158 Benchmark]: Boogie Preprocessor took 26.32ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:28,746 INFO L158 Benchmark]: RCFGBuilder took 178.00ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 71.5MB in the end (delta: 10.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:28,746 INFO L158 Benchmark]: BuchiAutomizer took 2297.02ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.3MB in the beginning and 94.8MB in the end (delta: -23.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:28,747 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.68ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.07ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.32ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 178.00ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 71.5MB in the end (delta: 10.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2297.02ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 71.3MB in the beginning and 94.8MB in the end (delta: -23.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 89 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 59 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp75 ukn80 mio100 lsp100 div100 bol100 ite100 ukn100 eq138 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:28,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...