/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/weaver-benchmarks/generated/array-eq-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:42,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:42,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:42,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:42,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:42,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:42,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:42,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:42,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:42,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:42,220 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:42,220 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:42,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:42,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:42,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:42,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:42,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:42,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:42,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:42,222 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:42,222 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:42,222 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:42,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:42,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:42,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:42,457 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:42,458 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:42,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl [2025-04-26 18:39:42,459 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-symm.wvr.bpl' [2025-04-26 18:39:42,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:42,477 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:42,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:42,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:42,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:42,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,513 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:42,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:42,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:42,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:42,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:42,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:42,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:42,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:42,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:42,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/1) ... [2025-04-26 18:39:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:42,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:42,565 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 18:39:42,570 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 18:39:42,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:42,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:42,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:42,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:42,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:42,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:42,588 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 18:39:42,621 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:42,623 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:42,704 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:42,704 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:42,710 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:42,711 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:42,711 INFO L201 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:42 BoogieIcfgContainer [2025-04-26 18:39:42,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:42,712 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:42,712 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:42,716 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:42,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:42,717 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:42" (1/2) ... [2025-04-26 18:39:42,718 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a8687ea and model type array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:42, skipping insertion in model container [2025-04-26 18:39:42,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:42,718 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:42" (2/2) ... [2025-04-26 18:39:42,719 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-eq-symm.wvr.bpl [2025-04-26 18:39:42,763 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:42,791 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:42,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:42,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:42,794 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 18:39:42,796 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 18:39:42,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 27 transitions, 68 flow [2025-04-26 18:39:42,849 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-26 18:39:42,850 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:42,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 4/23 cut-off events. For 2/2 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/18 useless extension candidates. Maximal degree in co-relation 17. Up to 3 conditions per place. [2025-04-26 18:39:42,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 27 transitions, 68 flow [2025-04-26 18:39:42,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 58 flow [2025-04-26 18:39:42,856 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 23 transitions, 58 flow [2025-04-26 18:39:42,856 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions, 58 flow [2025-04-26 18:39:42,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55 states, 53 states have (on average 2.207547169811321) internal successors, (in total 117), 54 states have internal predecessors, (117), 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 18:39:42,867 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 55 states, 53 states have (on average 2.207547169811321) internal successors, (in total 117), 54 states have internal predecessors, (117), 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 18:39:42,868 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:42,899 WARN L140 AmpleReduction]: Number of pruned transitions: 28 [2025-04-26 18:39:42,899 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:42,899 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13 [2025-04-26 18:39:42,899 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 18:39:42,899 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:22 [2025-04-26 18:39:42,899 WARN L145 AmpleReduction]: Times succ was already a loop node:7 [2025-04-26 18:39:42,899 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:20 [2025-04-26 18:39:42,899 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:42,900 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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 18:39:42,905 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:42,905 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:42,905 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:42,905 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:42,905 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:42,905 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:42,905 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:42,905 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:42,907 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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 18:39:42,915 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2025-04-26 18:39:42,916 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:42,916 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:42,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:42,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:42,919 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:42,919 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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 18:39:42,921 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2025-04-26 18:39:42,921 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:42,921 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:42,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:42,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:42,925 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:42,926 INFO L754 eck$LassoCheckResult]: Loop: "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[63] L22-->L23: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[65] L23-->L22-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" [2025-04-26 18:39:42,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2525, now seen corresponding path program 1 times [2025-04-26 18:39:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:42,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548414931] [2025-04-26 18:39:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:42,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:42,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:42,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:42,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:42,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:42,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:43,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:43,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 90430, now seen corresponding path program 1 times [2025-04-26 18:39:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068820989] [2025-04-26 18:39:43,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 75282914, now seen corresponding path program 1 times [2025-04-26 18:39:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137988640] [2025-04-26 18:39:43,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:43,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:43,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:43,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:43,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,203 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:43,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:43,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:43,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:43,204 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:43,204 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,204 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:43,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:43,204 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:43,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:43,205 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:43,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:43,341 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:43,344 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:43,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,347 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 18:39:43,348 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 18:39:43,350 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 18:39:43,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,391 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:43,398 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 18:39:43,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,400 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 18:39:43,405 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 18:39:43,406 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 18:39:43,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,424 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:43,431 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 18:39:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,433 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 18:39:43,435 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 18:39:43,436 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 18:39:43,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:43,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:43,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,469 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 18:39:43,470 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 18:39:43,473 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 18:39:43,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,494 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:43,500 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 18:39:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,503 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 18:39:43,505 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 18:39:43,507 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 18:39:43,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:43,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:43,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:43,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:43,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:43,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:43,528 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:43,537 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:43,537 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:43,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,566 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 18:39:43,568 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 18:39:43,569 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:43,585 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 18:39:43,586 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:43,586 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:43,586 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AB, An) = -1*i_AB + 1*An Supporting invariants [] [2025-04-26 18:39:43,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:43,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:43,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:43,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:43,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:43,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:43,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:43,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:43,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:43,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:43,693 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 18:39:43,713 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 18:39:43,714 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:43,789 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (in total 89), 54 states have internal predecessors, (89), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 179 states and 308 transitions. Complement of second has 7 states. [2025-04-26 18:39:43,790 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 18:39:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-26 18:39:43,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:39:43,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:43,799 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:39:43,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:43,799 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:39:43,800 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:43,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 308 transitions. [2025-04-26 18:39:43,809 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 45 [2025-04-26 18:39:43,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 104 states and 176 transitions. [2025-04-26 18:39:43,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-04-26 18:39:43,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-04-26 18:39:43,816 INFO L74 IsDeterministic]: Start isDeterministic. Operand 104 states and 176 transitions. [2025-04-26 18:39:43,817 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:43,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 176 transitions. [2025-04-26 18:39:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 176 transitions. [2025-04-26 18:39:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2025-04-26 18:39:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.7945205479452055) internal successors, (in total 131), 72 states have internal predecessors, (131), 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 18:39:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 131 transitions. [2025-04-26 18:39:43,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 131 transitions. [2025-04-26 18:39:43,839 INFO L438 stractBuchiCegarLoop]: Abstraction has 73 states and 131 transitions. [2025-04-26 18:39:43,839 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:43,839 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 131 transitions. [2025-04-26 18:39:43,841 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 33 [2025-04-26 18:39:43,841 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:43,841 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:43,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:43,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:43,841 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 18:39:43,841 INFO L754 eck$LassoCheckResult]: Loop: "[64] L22-->L27: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 18:39:43,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash 78336, now seen corresponding path program 1 times [2025-04-26 18:39:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072286043] [2025-04-26 18:39:43,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash 93402, now seen corresponding path program 1 times [2025-04-26 18:39:43,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434352213] [2025-04-26 18:39:43,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:43,885 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 18:39:43,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:43,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434352213] [2025-04-26 18:39:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434352213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:39:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665967211] [2025-04-26 18:39:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:43,890 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:39:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:43,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:39:43,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:39:43,894 INFO L87 Difference]: Start difference. First operand 73 states and 131 transitions. cyclomatic complexity: 69 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (in total 3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:43,914 INFO L93 Difference]: Finished difference Result 93 states and 146 transitions. [2025-04-26 18:39:43,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 146 transitions. [2025-04-26 18:39:43,915 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2025-04-26 18:39:43,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 65 states and 107 transitions. [2025-04-26 18:39:43,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-04-26 18:39:43,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-04-26 18:39:43,916 INFO L74 IsDeterministic]: Start isDeterministic. Operand 65 states and 107 transitions. [2025-04-26 18:39:43,916 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:43,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 107 transitions. [2025-04-26 18:39:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 107 transitions. [2025-04-26 18:39:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2025-04-26 18:39:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6862745098039216) internal successors, (in total 86), 50 states have internal predecessors, (86), 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 18:39:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2025-04-26 18:39:43,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 86 transitions. [2025-04-26 18:39:43,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:39:43,923 INFO L438 stractBuchiCegarLoop]: Abstraction has 51 states and 86 transitions. [2025-04-26 18:39:43,923 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:43,924 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 86 transitions. [2025-04-26 18:39:43,924 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 18:39:43,924 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:43,924 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:43,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:43,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:43,925 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[60] L22-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[62] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:39:43,925 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" [2025-04-26 18:39:43,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 75281936, now seen corresponding path program 1 times [2025-04-26 18:39:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870497482] [2025-04-26 18:39:43,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:43,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:43,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 97413, now seen corresponding path program 1 times [2025-04-26 18:39:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444887073] [2025-04-26 18:39:43,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:43,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash 751294486, now seen corresponding path program 1 times [2025-04-26 18:39:43,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561543887] [2025-04-26 18:39:43,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:43,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:43,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,034 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 18:39:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:44,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561543887] [2025-04-26 18:39:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561543887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153765008] [2025-04-26 18:39:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:44,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:44,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:44,064 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. cyclomatic complexity: 40 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:44,110 INFO L93 Difference]: Finished difference Result 60 states and 96 transitions. [2025-04-26 18:39:44,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 96 transitions. [2025-04-26 18:39:44,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 18:39:44,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 57 states and 93 transitions. [2025-04-26 18:39:44,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 18:39:44,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-04-26 18:39:44,112 INFO L74 IsDeterministic]: Start isDeterministic. Operand 57 states and 93 transitions. [2025-04-26 18:39:44,112 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:44,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 93 transitions. [2025-04-26 18:39:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 93 transitions. [2025-04-26 18:39:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-04-26 18:39:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6666666666666667) internal successors, (in total 85), 50 states have internal predecessors, (85), 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 18:39:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2025-04-26 18:39:44,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 85 transitions. [2025-04-26 18:39:44,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:44,118 INFO L438 stractBuchiCegarLoop]: Abstraction has 51 states and 85 transitions. [2025-04-26 18:39:44,118 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:44,118 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 85 transitions. [2025-04-26 18:39:44,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 18:39:44,119 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:44,119 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:44,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:44,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:44,119 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[63] L22-->L23: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[65] L23-->L22-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" "[60] L22-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:44,119 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" [2025-04-26 18:39:44,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash -667548149, now seen corresponding path program 1 times [2025-04-26 18:39:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165059908] [2025-04-26 18:39:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:44,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:44,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:44,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:44,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 97413, now seen corresponding path program 2 times [2025-04-26 18:39:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133639084] [2025-04-26 18:39:44,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:44,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1228258757, now seen corresponding path program 1 times [2025-04-26 18:39:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092506716] [2025-04-26 18:39:44,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:44,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:44,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,231 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 18:39:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:44,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092506716] [2025-04-26 18:39:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092506716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:44,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:44,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:39:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820185140] [2025-04-26 18:39:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:44,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:44,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:44,262 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 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 18:39:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:44,321 INFO L93 Difference]: Finished difference Result 89 states and 141 transitions. [2025-04-26 18:39:44,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 141 transitions. [2025-04-26 18:39:44,322 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 21 [2025-04-26 18:39:44,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 141 transitions. [2025-04-26 18:39:44,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-04-26 18:39:44,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-04-26 18:39:44,323 INFO L74 IsDeterministic]: Start isDeterministic. Operand 89 states and 141 transitions. [2025-04-26 18:39:44,323 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:44,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 141 transitions. [2025-04-26 18:39:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 141 transitions. [2025-04-26 18:39:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2025-04-26 18:39:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6111111111111112) internal successors, (in total 116), 71 states have internal predecessors, (116), 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 18:39:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2025-04-26 18:39:44,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 116 transitions. [2025-04-26 18:39:44,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:39:44,332 INFO L438 stractBuchiCegarLoop]: Abstraction has 72 states and 116 transitions. [2025-04-26 18:39:44,332 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:44,332 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 116 transitions. [2025-04-26 18:39:44,333 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 18:39:44,333 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:44,333 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:44,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:44,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:44,333 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[64] L22-->L27: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[60] L22-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:44,333 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[70] L37-->L38: Formula: (= (select v_B_3 v_i_BA_2) (select v_A_3 v_i_BA_2)) InVars {A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} OutVars{A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} AuxVars[] AssignedVars[]" "[72] L38-->L37-2: Formula: (= (+ v_i_BA_4 1) v_i_BA_3) InVars {i_BA=v_i_BA_4} OutVars{i_BA=v_i_BA_3} AuxVars[] AssignedVars[i_BA]" [2025-04-26 18:39:44,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash -667518327, now seen corresponding path program 1 times [2025-04-26 18:39:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019817170] [2025-04-26 18:39:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 97381, now seen corresponding path program 1 times [2025-04-26 18:39:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098398217] [2025-04-26 18:39:44,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -339831587, now seen corresponding path program 1 times [2025-04-26 18:39:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472393450] [2025-04-26 18:39:44,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:44,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:44,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,443 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 18:39:44,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:44,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472393450] [2025-04-26 18:39:44,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472393450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:44,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:44,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:39:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222509221] [2025-04-26 18:39:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:44,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:44,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:44,467 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. cyclomatic complexity: 51 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 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 18:39:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:44,510 INFO L93 Difference]: Finished difference Result 104 states and 160 transitions. [2025-04-26 18:39:44,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 160 transitions. [2025-04-26 18:39:44,511 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2025-04-26 18:39:44,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 160 transitions. [2025-04-26 18:39:44,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2025-04-26 18:39:44,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2025-04-26 18:39:44,512 INFO L74 IsDeterministic]: Start isDeterministic. Operand 104 states and 160 transitions. [2025-04-26 18:39:44,512 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:44,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 160 transitions. [2025-04-26 18:39:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 160 transitions. [2025-04-26 18:39:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2025-04-26 18:39:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5888888888888888) internal successors, (in total 143), 89 states have internal predecessors, (143), 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 18:39:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2025-04-26 18:39:44,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-04-26 18:39:44,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:39:44,516 INFO L438 stractBuchiCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-04-26 18:39:44,516 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:44,516 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 143 transitions. [2025-04-26 18:39:44,517 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 18:39:44,517 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:44,517 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:44,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:44,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:44,518 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[64] L22-->L27: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[66] L27-->L22-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" "[60] L22-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:44,518 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[71] L37-->L42: Formula: (not (= (select v_A_4 v_i_BA_5) (select v_B_4 v_i_BA_5))) InVars {A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} OutVars{A=v_A_4, B=v_B_4, i_BA=v_i_BA_5} AuxVars[] AssignedVars[]" "[73] L42-->L37-2: Formula: v_break_BA_2 InVars {} OutVars{break_BA=v_break_BA_2} AuxVars[] AssignedVars[break_BA]" [2025-04-26 18:39:44,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash -667518327, now seen corresponding path program 2 times [2025-04-26 18:39:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029342019] [2025-04-26 18:39:44,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:44,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:44,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:44,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:44,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 97413, now seen corresponding path program 3 times [2025-04-26 18:39:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323378055] [2025-04-26 18:39:44,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:44,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash -339831555, now seen corresponding path program 1 times [2025-04-26 18:39:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424139207] [2025-04-26 18:39:44,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:44,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:44,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,657 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:44,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:44,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:44,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:44,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:44,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:44,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:44,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:44,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:44,657 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:44,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,821 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:44,821 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:44,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,827 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 18:39:44,835 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 18:39:44,835 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 18:39:44,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,853 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,858 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 18:39:44,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,861 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 18:39:44,862 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 18:39:44,864 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 18:39:44,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,879 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:44,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,887 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 18:39:44,889 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 18:39:44,890 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 18:39:44,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,912 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 18:39:44,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,914 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 18:39:44,915 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 18:39:44,915 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 18:39:44,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,925 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:44,925 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:39:44,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,933 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 18:39:44,933 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:39:44,948 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:39:44,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,956 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 18:39:44,957 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 18:39:44,957 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 18:39:44,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,971 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,977 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 18:39:44,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,979 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 18:39:44,979 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 18:39:44,981 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 18:39:44,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:45,005 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:39:45,005 INFO L437 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:39:45,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,007 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 18:39:45,008 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 18:39:45,009 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:45,024 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 18:39:45,025 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:45,025 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:45,025 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_BA 1 0)_2) = -2*v_rep(ite break_BA 1 0)_2 + 1 Supporting invariants [] [2025-04-26 18:39:45,030 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 18:39:45,034 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:45,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:45,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:45,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:45,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,065 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,082 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 18:39:45,083 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 18:39:45,083 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 143 transitions. cyclomatic complexity: 64 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 18:39:45,112 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 143 transitions. cyclomatic complexity: 64. 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 149 states and 236 transitions. Complement of second has 6 states. [2025-04-26 18:39:45,112 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 18:39:45,113 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 18:39:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-26 18:39:45,113 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:39:45,113 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,113 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:39:45,113 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,113 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:39:45,113 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 236 transitions. [2025-04-26 18:39:45,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:39:45,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 69 states and 102 transitions. [2025-04-26 18:39:45,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 18:39:45,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 18:39:45,117 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69 states and 102 transitions. [2025-04-26 18:39:45,117 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:45,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 102 transitions. [2025-04-26 18:39:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 102 transitions. [2025-04-26 18:39:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 40. [2025-04-26 18:39:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.5) internal successors, (in total 60), 39 states have internal predecessors, (60), 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 18:39:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2025-04-26 18:39:45,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-04-26 18:39:45,120 INFO L438 stractBuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2025-04-26 18:39:45,120 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:45,120 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 60 transitions. [2025-04-26 18:39:45,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:39:45,120 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:45,120 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:45,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:45,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:45,121 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L52: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (or (and v_break_BA_4 v_break_AB_4) (and (not v_break_BA_4) .cse0)) (= v_i_BA_8 v_i_AB_8) .cse0)) InVars {break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} OutVars{break_BA=v_break_BA_4, i_AB=v_i_AB_8, break_AB=v_break_AB_4, i_BA=v_i_BA_8} AuxVars[] AssignedVars[]" "[76] L52-->L22-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L22-2-->L22: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[63] L22-->L23: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[79] L52-1-->L37-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[65] L23-->L22-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" "[60] L22-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:45,121 INFO L754 eck$LassoCheckResult]: Loop: "[68] L37-2-->L37: Formula: (and (< v_i_BA_1 v_Bn_3) (< v_i_BA_1 v_An_3) (not v_break_BA_1)) InVars {break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} OutVars{break_BA=v_break_BA_1, Bn=v_Bn_3, An=v_An_3, i_BA=v_i_BA_1} AuxVars[] AssignedVars[]" "[70] L37-->L38: Formula: (= (select v_B_3 v_i_BA_2) (select v_A_3 v_i_BA_2)) InVars {A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} OutVars{A=v_A_3, B=v_B_3, i_BA=v_i_BA_2} AuxVars[] AssignedVars[]" "[72] L38-->L37-2: Formula: (= (+ v_i_BA_4 1) v_i_BA_3) InVars {i_BA=v_i_BA_4} OutVars{i_BA=v_i_BA_3} AuxVars[] AssignedVars[i_BA]" [2025-04-26 18:39:45,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -667548149, now seen corresponding path program 2 times [2025-04-26 18:39:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:45,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728751039] [2025-04-26 18:39:45,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:45,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:45,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:45,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:45,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:45,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:45,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 97381, now seen corresponding path program 2 times [2025-04-26 18:39:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:45,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373217824] [2025-04-26 18:39:45,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:45,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:45,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:45,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:45,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:45,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1228258789, now seen corresponding path program 1 times [2025-04-26 18:39:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:45,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996430905] [2025-04-26 18:39:45,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:45,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:45,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:45,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:45,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:45,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:45,275 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:45,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:45,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:45,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:45,275 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:45,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:45,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:45,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:39:45,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:45,275 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:45,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,398 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:45,398 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:45,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,400 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 18:39:45,401 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 18:39:45,402 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 18:39:45,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,414 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,422 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 18:39:45,422 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 18:39:45,424 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 18:39:45,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,438 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,444 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 18:39:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,445 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 18:39:45,446 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 18:39:45,447 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 18:39:45,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,469 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,474 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 18:39:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,476 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 18:39:45,477 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 18:39:45,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:45,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,489 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:45,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,492 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:45,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:45,511 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 18:39:45,511 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:45,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,513 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 18:39:45,514 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 18:39:45,515 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:45,531 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 18:39:45,531 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:45,531 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:45,532 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(An, i_BA) = 1*An - 1*i_BA Supporting invariants [] [2025-04-26 18:39:45,537 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 18:39:45,538 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:45,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:45,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:45,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,586 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 18:39:45,586 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 18:39:45,587 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 60 transitions. cyclomatic complexity: 25 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 18:39:45,614 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 60 transitions. cyclomatic complexity: 25. 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 67 states and 100 transitions. Complement of second has 6 states. [2025-04-26 18:39:45,615 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 18:39:45,616 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 18:39:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 18:39:45,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:39:45,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:39:45,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:39:45,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 100 transitions. [2025-04-26 18:39:45,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:45,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2025-04-26 18:39:45,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:45,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:45,617 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:45,617 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:45,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:45,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:45,617 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:45,617 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:45,617 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:45,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:45,617 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:45,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:39:45,632 INFO L201 PluginConnector]: Adding new model array-eq-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:45 BoogieIcfgContainer [2025-04-26 18:39:45,632 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:45,632 INFO L158 Benchmark]: Toolchain (without parser) took 3155.49ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.1MB in the beginning and 71.8MB in the end (delta: 13.3MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2025-04-26 18:39:45,633 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.42ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:45,633 INFO L158 Benchmark]: Boogie Preprocessor took 25.28ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.0MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:45,633 INFO L158 Benchmark]: RCFGBuilder took 168.10ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 72.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:45,633 INFO L158 Benchmark]: BuchiAutomizer took 2920.02ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.7MB in the beginning and 71.8MB in the end (delta: 832.8kB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:45,634 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.42ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.28ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.0MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 168.10ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 72.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2920.02ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.7MB in the beginning and 71.8MB in the end (delta: 832.8kB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 111 StatesRemovedByMinimization, 6 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, 162 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 96 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital54 mio100 ax100 hnf100 lsp66 ukn99 mio100 lsp71 div100 bol100 ite100 ukn100 eq166 hnf94 smp94 dnf129 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 111, Number of transitions in reduction automaton: 89, Number of states in reduction automaton: 55, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_AB + An and consists of 5 locations. One deterministic module has affine ranking function -2 * (if break_BA then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function An + -1 * i_BA and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:45,647 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...