/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:52:16,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:16,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:16,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:16,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:16,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:16,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:16,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:16,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:16,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:16,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:16,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:16,574 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:16,574 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:16,574 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:16,574 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:16,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:16,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:16,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:16,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:16,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:16,579 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:16,580 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:16,580 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:16,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:16,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:16,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:16,774 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:16,774 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:16,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl [2025-04-26 16:52:16,777 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl' [2025-04-26 16:52:16,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:16,795 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:16,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:16,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:16,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:16,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,847 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 20 [2025-04-26 16:52:16,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:16,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:16,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:16,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:16,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:16,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:16,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:16,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:16,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/1) ... [2025-04-26 16:52:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:16,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:16,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:52:16,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:52:16,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:52:16,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:52:16,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:52:16,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:52:16,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:52:16,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:52:16,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:16,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:16,926 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:52:16,968 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:16,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:17,029 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:17,030 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:17,046 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:17,047 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:52:17,047 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:17 BoogieIcfgContainer [2025-04-26 16:52:17,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:17,048 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:17,048 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:17,052 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:17,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:17,052 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:16" (1/2) ... [2025-04-26 16:52:17,054 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41c2c0b5 and model type equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:52:17, skipping insertion in model container [2025-04-26 16:52:17,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:17,054 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:17" (2/2) ... [2025-04-26 16:52:17,055 INFO L376 chiAutomizerObserver]: Analyzing ICFG equal-array-sums-locked.bpl [2025-04-26 16:52:17,092 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:52:17,120 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:17,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:17,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:52:17,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-04-26 16:52:17,192 INFO L116 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-04-26 16:52:17,193 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:52:17,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:52:17,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-04-26 16:52:17,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 62 flow [2025-04-26 16:52:17,198 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 25 transitions, 62 flow [2025-04-26 16:52:17,203 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:17,262 WARN L140 AmpleReduction]: Number of pruned transitions: 34 [2025-04-26 16:52:17,262 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:52:17,262 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 16:52:17,262 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 16:52:17,262 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:34 [2025-04-26 16:52:17,262 WARN L145 AmpleReduction]: Times succ was already a loop node:7 [2025-04-26 16:52:17,262 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:5 [2025-04-26 16:52:17,262 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:17,264 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 65 states, 63 states have (on average 1.3174603174603174) internal successors, (in total 83), 64 states have internal predecessors, (83), 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:52:17,269 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:17,269 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:17,269 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:17,269 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:17,270 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:17,270 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:17,270 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:17,270 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:17,273 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 63 states have (on average 1.3174603174603174) internal successors, (in total 83), 64 states have internal predecessors, (83), 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:52:17,284 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 46 [2025-04-26 16:52:17,286 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:17,286 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:17,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:17,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:52:17,289 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:17,289 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 states, 63 states have (on average 1.3174603174603174) internal successors, (in total 83), 64 states have internal predecessors, (83), 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:52:17,292 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 46 [2025-04-26 16:52:17,292 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:17,292 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:17,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:17,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:52:17,297 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y]" "[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0]" "[66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1]" [2025-04-26 16:52:17,297 INFO L754 eck$LassoCheckResult]: Loop: "[68] L40-1-->L65: Formula: (< |v_thread1Thread1of1ForFork0_i#1_5| v_n_1) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} AuxVars[] AssignedVars[]" "[70] L65-->L65-2: Formula: (and (not v_m_8) v_m_7) InVars {m=v_m_8} OutVars{m=v_m_7} AuxVars[] AssignedVars[m]" "[71] L65-2-->L71: Formula: (= v_x_1 (+ (select v_A_1 |v_thread1Thread1of1ForFork0_i#1_7|) v_x_2)) InVars {A=v_A_1, x=v_x_2, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, x=v_x_1, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[x]" "[72] L71-->L68: Formula: (not v_m_3) InVars {} OutVars{m=v_m_3} AuxVars[] AssignedVars[m]" "[73] L68-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_10| (+ |v_thread1Thread1of1ForFork0_i#1_9| 1)) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_9|} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1]" [2025-04-26 16:52:17,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2881826, now seen corresponding path program 1 times [2025-04-26 16:52:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:17,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291373003] [2025-04-26 16:52:17,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:17,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:17,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:17,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:17,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:17,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:17,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:17,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 93584485, now seen corresponding path program 1 times [2025-04-26 16:52:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:17,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043785028] [2025-04-26 16:52:17,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:17,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:17,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:17,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:17,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:17,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:17,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:17,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:17,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:17,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:17,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2025091100, now seen corresponding path program 1 times [2025-04-26 16:52:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:17,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254818904] [2025-04-26 16:52:17,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:17,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:17,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:17,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:17,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:17,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:17,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:17,534 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:17,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:17,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:17,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:17,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:17,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:17,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:17,535 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:17,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:52:17,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:17,535 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:17,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:17,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:17,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:17,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:17,656 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:17,667 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:17,671 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:52:17,673 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:52:17,674 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:52:17,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:17,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:52:17,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:17,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:17,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:17,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:52:17,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:52:17,708 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:17,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:52:17,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:17,717 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:52:17,717 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:52:17,718 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:52:17,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:17,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:17,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:17,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:17,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:17,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:17,738 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:17,744 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:52:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:17,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:17,746 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:52:17,747 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:52:17,749 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:52:17,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:17,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:17,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:17,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:17,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:17,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:17,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:17,779 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:52:17,779 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:52:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:17,804 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:52:17,805 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:52:17,805 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:17,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:17,825 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:52:17,826 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:17,826 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread1Thread1of1ForFork0_i#1) = 1*n - 1*thread1Thread1of1ForFork0_i#1 Supporting invariants [] [2025-04-26 16:52:17,831 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:52:17,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:17,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:17,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:17,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:17,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:17,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:17,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:17,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:17,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:17,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:17,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:17,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:17,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:17,912 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:52:17,927 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:52:17,929 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65 states, 63 states have (on average 1.3174603174603174) internal successors, (in total 83), 64 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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:52:18,003 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65 states, 63 states have (on average 1.3174603174603174) internal successors, (in total 83), 64 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 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 128 states and 169 transitions. Complement of second has 6 states. [2025-04-26 16:52:18,004 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:52:18,008 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:52:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 16:52:18,014 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 4 letters. Loop has 5 letters. [2025-04-26 16:52:18,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:18,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 16:52:18,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:18,015 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 4 letters. Loop has 10 letters. [2025-04-26 16:52:18,015 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:18,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 169 transitions. [2025-04-26 16:52:18,021 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-04-26 16:52:18,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 67 states and 88 transitions. [2025-04-26 16:52:18,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-04-26 16:52:18,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-04-26 16:52:18,027 INFO L74 IsDeterministic]: Start isDeterministic. Operand 67 states and 88 transitions. [2025-04-26 16:52:18,027 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:52:18,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 88 transitions. [2025-04-26 16:52:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 88 transitions. [2025-04-26 16:52:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-04-26 16:52:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.3015873015873016) internal successors, (in total 82), 62 states have internal predecessors, (82), 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:52:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-04-26 16:52:18,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-04-26 16:52:18,045 INFO L438 stractBuchiCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-04-26 16:52:18,045 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:18,045 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 82 transitions. [2025-04-26 16:52:18,046 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-04-26 16:52:18,046 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:18,046 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:18,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:18,046 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:52:18,047 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y]" "[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0]" "[66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1]" "[68] L40-1-->L65: Formula: (< |v_thread1Thread1of1ForFork0_i#1_5| v_n_1) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} AuxVars[] AssignedVars[]" "[87] L26-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_14|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] $Ultimate##0-->L54-1: Formula: (= |v_thread2Thread1of1ForFork1_j#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1]" [2025-04-26 16:52:18,047 INFO L754 eck$LassoCheckResult]: Loop: "[76] L54-1-->L65: Formula: (< |v_thread2Thread1of1ForFork1_j#1_5| v_n_3) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} AuxVars[] AssignedVars[]" "[78] L65-->L65-2: Formula: (and v_m_11 (not v_m_12)) InVars {m=v_m_12} OutVars{m=v_m_11} AuxVars[] AssignedVars[m]" "[79] L65-2-->L71: Formula: (= (+ v_y_2 (select v_A_2 |v_thread2Thread1of1ForFork1_j#1_7|)) v_y_1) InVars {A=v_A_2, y=v_y_2, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} OutVars{A=v_A_2, y=v_y_1, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} AuxVars[] AssignedVars[y]" "[80] L71-->L68: Formula: (not v_m_6) InVars {} OutVars{m=v_m_6} AuxVars[] AssignedVars[m]" "[81] L68-->L54-1: Formula: (= (+ |v_thread2Thread1of1ForFork1_j#1_9| 1) |v_thread2Thread1of1ForFork1_j#1_10|) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_9|} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1]" [2025-04-26 16:52:18,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash -46799435, now seen corresponding path program 1 times [2025-04-26 16:52:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:18,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286799991] [2025-04-26 16:52:18,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:18,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:18,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:18,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:18,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:18,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:18,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:18,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:18,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:18,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 101218925, now seen corresponding path program 1 times [2025-04-26 16:52:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:18,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612003440] [2025-04-26 16:52:18,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:18,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:18,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:18,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:18,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:18,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:18,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:18,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:18,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash -85850823, now seen corresponding path program 1 times [2025-04-26 16:52:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:18,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652451663] [2025-04-26 16:52:18,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:18,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:18,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:18,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:18,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:18,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:18,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:18,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:18,168 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:18,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:18,168 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:18,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:18,169 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:18,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:18,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:18,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:18,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:52:18,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:18,169 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:18,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:18,278 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:18,278 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:18,281 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:52:18,282 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:52:18,283 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:52:18,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:18,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:18,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:18,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:18,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:18,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:18,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:18,309 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:52:18,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:18,311 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:52:18,312 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:52:18,314 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:52:18,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:18,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:18,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:18,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:18,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:18,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:18,333 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:18,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:18,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:18,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:18,341 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:52:18,342 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:52:18,344 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:52:18,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:18,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:18,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:18,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:18,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:18,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:18,361 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:18,366 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:52:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:18,369 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:52:18,371 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:52:18,373 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:52:18,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:18,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:18,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:18,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:18,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:18,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:18,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:18,399 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:52:18,399 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:52:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:18,401 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:52:18,403 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:52:18,404 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:18,420 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:52:18,420 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:52:18,420 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:18,420 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread2Thread1of1ForFork1_j#1) = 1*n - 1*thread2Thread1of1ForFork1_j#1 Supporting invariants [] [2025-04-26 16:52:18,425 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:52:18,426 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:18,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:18,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:18,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:18,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:18,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:18,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:18,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:52:18,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:52:18,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:18,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:18,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:18,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:18,491 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:52:18,492 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:52:18,492 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 82 transitions. cyclomatic complexity: 26 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:52:18,525 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 82 transitions. cyclomatic complexity: 26. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 112 states and 149 transitions. Complement of second has 6 states. [2025-04-26 16:52:18,526 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:52:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:52:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-04-26 16:52:18,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 5 letters. [2025-04-26 16:52:18,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:18,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 12 letters. Loop has 5 letters. [2025-04-26 16:52:18,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:18,527 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 10 letters. [2025-04-26 16:52:18,527 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:18,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 149 transitions. [2025-04-26 16:52:18,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:18,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 0 states and 0 transitions. [2025-04-26 16:52:18,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:52:18,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:52:18,529 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:52:18,529 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:18,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:18,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:18,529 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:18,529 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:52:18,529 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:52:18,530 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:18,530 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:52:18,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:18,543 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:52:18 BoogieIcfgContainer [2025-04-26 16:52:18,543 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:52:18,546 INFO L158 Benchmark]: Toolchain (without parser) took 1749.15ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 108.3MB in the beginning and 54.3MB in the end (delta: 54.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2025-04-26 16:52:18,546 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 184.5MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:18,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.48ms. Allocated memory is still 184.5MB. Free memory was 108.3MB in the beginning and 105.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:18,547 INFO L158 Benchmark]: Boogie Preprocessor took 22.54ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 104.8MB in the end (delta: 973.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:52:18,547 INFO L158 Benchmark]: RCFGBuilder took 174.74ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 95.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:18,547 INFO L158 Benchmark]: BuchiAutomizer took 1495.80ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 95.1MB in the beginning and 54.3MB in the end (delta: 40.8MB). Peak memory consumption was 2.7MB. Max. memory is 8.0GB. [2025-04-26 16:52:18,550 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.78ms. Allocated memory is still 184.5MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.48ms. Allocated memory is still 184.5MB. Free memory was 108.3MB in the beginning and 105.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.54ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 104.8MB in the end (delta: 973.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 174.74ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 95.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1495.80ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 95.1MB in the beginning and 54.3MB in the end (delta: 40.8MB). Peak memory consumption was 2.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 28 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital41 mio100 ax100 hnf100 lsp65 ukn92 mio100 lsp65 div100 bol100 ite100 ukn100 eq163 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 145, Number of transitions in reduction automaton: 83, Number of states in reduction automaton: 65, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * j + 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:52:18,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...