/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-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:42,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:42,892 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,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:42,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:42,895 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,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:42,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:42,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:42,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:42,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:42,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:42,911 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:42,911 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:42,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:42,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:42,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:42,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:42,913 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:42,913 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:43,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:43,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:43,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:43,207 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:43,207 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:43,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl [2025-04-26 18:39:43,208 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/array-eq-trans.wvr.bpl' [2025-04-26 18:39:43,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:43,224 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:43,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:43,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:43,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:43,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,252 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:43,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:43,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:43,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:43,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:43,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:43,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:43,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:43,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:43,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/1) ... [2025-04-26 18:39:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:43,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,302 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:43,305 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:43,324 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:43,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:43,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:43,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:43,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:43,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:43,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:43,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:43,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:43,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:43,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:43,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:43,326 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:43,364 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:43,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:43,442 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:43,442 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:43,450 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:43,450 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:43,451 INFO L201 PluginConnector]: Adding new model array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:43 BoogieIcfgContainer [2025-04-26 18:39:43,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:43,451 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:43,451 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:43,455 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:43,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:43,456 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:43" (1/2) ... [2025-04-26 18:39:43,458 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ec048ce and model type array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:43, skipping insertion in model container [2025-04-26 18:39:43,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:43,458 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:43" (2/2) ... [2025-04-26 18:39:43,459 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-eq-trans.wvr.bpl [2025-04-26 18:39:43,505 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:39:43,530 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:43,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:43,534 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:43,535 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:43,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 97 flow [2025-04-26 18:39:43,601 INFO L116 PetriNetUnfolderBase]: 6/32 cut-off events. [2025-04-26 18:39:43,602 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:39:43,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 6/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-04-26 18:39:43,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 97 flow [2025-04-26 18:39:43,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 82 flow [2025-04-26 18:39:43,609 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 32 transitions, 82 flow [2025-04-26 18:39:43,610 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 82 flow [2025-04-26 18:39:43,646 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 307 states, 305 states have (on average 3.3737704918032785) internal successors, (in total 1029), 306 states have internal predecessors, (1029), 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,647 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 307 states, 305 states have (on average 3.3737704918032785) internal successors, (in total 1029), 306 states have internal predecessors, (1029), 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,648 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:43,726 WARN L140 AmpleReduction]: Number of pruned transitions: 388 [2025-04-26 18:39:43,727 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:43,728 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 96 [2025-04-26 18:39:43,728 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:39:43,729 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:184 [2025-04-26 18:39:43,729 WARN L145 AmpleReduction]: Times succ was already a loop node:55 [2025-04-26 18:39:43,729 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:213 [2025-04-26 18:39:43,729 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:43,730 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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,737 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:43,738 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:43,738 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:43,738 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:43,738 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:43,738 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:43,738 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:43,738 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:43,740 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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,761 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 280 [2025-04-26 18:39:43,761 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:43,761 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:43,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:43,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:43,767 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:43,768 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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,776 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 280 [2025-04-26 18:39:43,780 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:43,780 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:43,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:43,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:43,784 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:43,785 INFO L754 eck$LassoCheckResult]: Loop: "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" "[89] L26-->L31: Formula: (not (= (select v_A_2 v_i_AB_5) (select v_B_2 v_i_AB_5))) InVars {A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} OutVars{A=v_A_2, i_AB=v_i_AB_5, B=v_B_2} AuxVars[] AssignedVars[]" "[91] L31-->L26-2: Formula: v_break_AB_2 InVars {} OutVars{break_AB=v_break_AB_2} AuxVars[] AssignedVars[break_AB]" [2025-04-26 18:39:43,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 1 times [2025-04-26 18:39:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717732637] [2025-04-26 18:39:43,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:43,841 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,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:43,847 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,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash 115287, now seen corresponding path program 1 times [2025-04-26 18:39:43,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523765745] [2025-04-26 18:39:43,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,873 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,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:43,877 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,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:43,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 103966713, now seen corresponding path program 1 times [2025-04-26 18:39:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:43,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336367880] [2025-04-26 18:39:43,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:43,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:43,890 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,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:43,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:43,896 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,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:43,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:43,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,069 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:44,069 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:44,069 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:44,069 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:44,069 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:44,069 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:44,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:44,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:44,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:44,070 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:44,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,248 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:44,250 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,253 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:44,255 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:44,256 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,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,282 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:39:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,291 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:44,291 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:44,292 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,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,311 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,317 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:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,319 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:44,321 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:44,324 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,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,339 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,345 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:44,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,347 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:44,348 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:44,349 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,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,374 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,380 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:44,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,382 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:44,382 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:44,385 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,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:44,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,395 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:39:44,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 18:39:44,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:44,398 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,406 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:44,406 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:44,408 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,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,425 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:44,429 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:39:44,429 INFO L437 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,432 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,433 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,436 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:44,453 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,453 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:44,454 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:44,454 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_AB 1 0)_1) = -2*v_rep(ite break_AB 1 0)_1 + 1 Supporting invariants [] [2025-04-26 18:39:44,460 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:44,463 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:44,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:44,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:44,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:44,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,508 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,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:44,508 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:44,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:44,525 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,538 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:44,540 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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:44,626 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 307 states, 305 states have (on average 2.101639344262295) internal successors, (in total 641), 306 states have internal predecessors, (641), 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 1033 states and 2248 transitions. Complement of second has 7 states. [2025-04-26 18:39:44,629 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:44,633 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:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-26 18:39:44,636 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:39:44,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:44,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:39:44,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:44,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:39:44,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:44,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1033 states and 2248 transitions. [2025-04-26 18:39:44,655 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 345 [2025-04-26 18:39:44,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1033 states to 688 states and 1451 transitions. [2025-04-26 18:39:44,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2025-04-26 18:39:44,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2025-04-26 18:39:44,670 INFO L74 IsDeterministic]: Start isDeterministic. Operand 688 states and 1451 transitions. [2025-04-26 18:39:44,670 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:44,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 688 states and 1451 transitions. [2025-04-26 18:39:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states and 1451 transitions. [2025-04-26 18:39:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 461. [2025-04-26 18:39:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 461 states have (on average 2.2364425162689803) internal successors, (in total 1031), 460 states have internal predecessors, (1031), 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,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1031 transitions. [2025-04-26 18:39:44,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 461 states and 1031 transitions. [2025-04-26 18:39:44,717 INFO L438 stractBuchiCegarLoop]: Abstraction has 461 states and 1031 transitions. [2025-04-26 18:39:44,717 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:44,717 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 461 states and 1031 transitions. [2025-04-26 18:39:44,719 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 237 [2025-04-26 18:39:44,719 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:44,719 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:44,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:44,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:44,720 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 18:39:44,720 INFO L754 eck$LassoCheckResult]: Loop: "[88] L26-->L27: Formula: (= (select v_B_1 v_i_AB_2) (select v_A_1 v_i_AB_2)) InVars {A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} OutVars{A=v_A_1, i_AB=v_i_AB_2, B=v_B_1} AuxVars[] AssignedVars[]" "[90] L27-->L26-2: Formula: (= v_i_AB_3 (+ v_i_AB_4 1)) InVars {i_AB=v_i_AB_4} OutVars{i_AB=v_i_AB_3} AuxVars[] AssignedVars[i_AB]" "[86] L26-2-->L26: Formula: (and (not v_break_AB_1) (< v_i_AB_1 v_An_1) (< v_i_AB_1 v_Bn_1)) InVars {i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} OutVars{i_AB=v_i_AB_1, break_AB=v_break_AB_1, Bn=v_Bn_1, An=v_An_1} AuxVars[] AssignedVars[]" [2025-04-26 18:39:44,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 108183, now seen corresponding path program 1 times [2025-04-26 18:39:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446180198] [2025-04-26 18:39:44,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,724 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,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,730 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,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 117235, now seen corresponding path program 1 times [2025-04-26 18:39:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558857835] [2025-04-26 18:39:44,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,737 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,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:44,747 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,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1072000099, now seen corresponding path program 1 times [2025-04-26 18:39:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:44,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168662889] [2025-04-26 18:39:44,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:44,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:44,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:44,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:44,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:44,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:44,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:44,871 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:44,871 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:44,871 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:44,871 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:44,871 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:44,871 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,871 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:44,871 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:44,871 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:39:44,871 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:44,871 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:44,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:44,968 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:44,968 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:44,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,970 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,973 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,974 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,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:44,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:44,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:44,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:44,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:44,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:44,988 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:44,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:44,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:44,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:44,998 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,999 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:45,001 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,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,016 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,024 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:45,025 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:45,026 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,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,040 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,045 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:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,047 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:45,049 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:45,050 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,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,064 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,071 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:45,073 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:45,074 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,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:45,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:45,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:45,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,093 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,094 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,095 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,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:45,121 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:45,121 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:39:45,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,124 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,125 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,126 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:45,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:39:45,143 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:45,143 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:45,143 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_AB, Bn) = -1*i_AB + 1*Bn Supporting invariants [] [2025-04-26 18:39:45,149 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,150 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:45,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,167 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,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,177 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,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,194 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,194 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,195 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 461 states and 1031 transitions. cyclomatic complexity: 614 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:45,267 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 461 states and 1031 transitions. cyclomatic complexity: 614. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1501 states and 3230 transitions. Complement of second has 6 states. [2025-04-26 18:39:45,267 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,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 18:39:45,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:39:45,268 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:39:45,268 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,268 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:39:45,268 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1501 states and 3230 transitions. [2025-04-26 18:39:45,278 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 288 [2025-04-26 18:39:45,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1501 states to 1072 states and 2267 transitions. [2025-04-26 18:39:45,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 494 [2025-04-26 18:39:45,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2025-04-26 18:39:45,286 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1072 states and 2267 transitions. [2025-04-26 18:39:45,286 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:45,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1072 states and 2267 transitions. [2025-04-26 18:39:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states and 2267 transitions. [2025-04-26 18:39:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 830. [2025-04-26 18:39:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 830 states have (on average 2.197590361445783) internal successors, (in total 1824), 829 states have internal predecessors, (1824), 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,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1824 transitions. [2025-04-26 18:39:45,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 830 states and 1824 transitions. [2025-04-26 18:39:45,313 INFO L438 stractBuchiCegarLoop]: Abstraction has 830 states and 1824 transitions. [2025-04-26 18:39:45,313 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:45,313 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 830 states and 1824 transitions. [2025-04-26 18:39:45,316 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2025-04-26 18:39:45,316 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:45,316 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:45,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:45,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:45,317 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:39:45,317 INFO L754 eck$LassoCheckResult]: Loop: "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" "[95] L41-->L42: Formula: (= (select v_C_1 v_i_BC_2) (select v_B_3 v_i_BC_2)) InVars {i_BC=v_i_BC_2, C=v_C_1, B=v_B_3} OutVars{i_BC=v_i_BC_2, C=v_C_1, B=v_B_3} AuxVars[] AssignedVars[]" "[97] L42-->L41-2: Formula: (= (+ v_i_BC_4 1) v_i_BC_3) InVars {i_BC=v_i_BC_4} OutVars{i_BC=v_i_BC_3} AuxVars[] AssignedVars[i_BC]" [2025-04-26 18:39:45,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 103965710, now seen corresponding path program 1 times [2025-04-26 18:39:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:45,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770618933] [2025-04-26 18:39:45,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:45,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:45,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:45,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:45,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:45,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:45,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:45,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 122206, now seen corresponding path program 1 times [2025-04-26 18:39:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:45,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236679618] [2025-04-26 18:39:45,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,335 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,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,336 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,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:45,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash 571138609, now seen corresponding path program 1 times [2025-04-26 18:39:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:45,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230883346] [2025-04-26 18:39:45,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:45,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:45,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:45,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:45,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:45,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:45,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:45,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:45,464 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:45,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:45,464 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:45,464 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:45,464 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:45,464 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,464 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:45,464 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:45,464 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:45,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:45,464 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:45,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:45,582 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:45,582 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:45,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,586 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,587 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,587 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,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,602 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,607 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,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,609 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,610 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,612 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,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,631 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,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,633 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,634 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,635 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,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,649 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:39:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,657 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,658 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,659 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,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,678 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,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,680 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:45,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:39:45,683 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,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,697 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:39:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,706 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:45,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:39:45,709 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,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,724 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,731 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:45,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:39:45,732 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,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:45,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,745 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:39:45,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,753 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:45,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:39:45,755 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,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:45,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:45,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:45,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:45,767 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:45,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:39:45,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,774 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:45,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:39:45,775 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,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:45,785 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:45,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:45,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:45,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:45,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:45,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:45,799 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:45,799 INFO L437 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:39:45,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:45,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:45,801 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:45,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:39:45,803 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:45,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:45,819 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:45,819 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:45,819 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_BC, Bn) = -1*i_BC + 1*Bn Supporting invariants [] [2025-04-26 18:39:45,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:39:45,826 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:45,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:45,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:45,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:45,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:45,851 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,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:45,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:45,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:45,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:45,864 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,865 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,865 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 830 states and 1824 transitions. cyclomatic complexity: 1039 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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:45,918 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 830 states and 1824 transitions. cyclomatic complexity: 1039. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 2806 states and 6054 transitions. Complement of second has 6 states. [2025-04-26 18:39:45,919 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,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 18:39:45,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:39:45,920 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,920 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:39:45,920 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,920 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:39:45,920 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:45,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2806 states and 6054 transitions. [2025-04-26 18:39:45,960 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 116 [2025-04-26 18:39:45,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2806 states to 2096 states and 4516 transitions. [2025-04-26 18:39:45,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 547 [2025-04-26 18:39:45,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 600 [2025-04-26 18:39:45,972 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2096 states and 4516 transitions. [2025-04-26 18:39:45,972 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:45,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2096 states and 4516 transitions. [2025-04-26 18:39:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states and 4516 transitions. [2025-04-26 18:39:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1505. [2025-04-26 18:39:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1505 states have (on average 2.172093023255814) internal successors, (in total 3269), 1504 states have internal predecessors, (3269), 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:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 3269 transitions. [2025-04-26 18:39:46,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1505 states and 3269 transitions. [2025-04-26 18:39:46,002 INFO L438 stractBuchiCegarLoop]: Abstraction has 1505 states and 3269 transitions. [2025-04-26 18:39:46,002 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:46,002 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1505 states and 3269 transitions. [2025-04-26 18:39:46,006 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2025-04-26 18:39:46,006 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:46,006 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:46,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:39:46,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:46,007 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" [2025-04-26 18:39:46,007 INFO L754 eck$LassoCheckResult]: Loop: "[96] L41-->L46: Formula: (not (= (select v_B_4 v_i_BC_5) (select v_C_2 v_i_BC_5))) InVars {i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} OutVars{i_BC=v_i_BC_5, C=v_C_2, B=v_B_4} AuxVars[] AssignedVars[]" "[98] L46-->L41-2: Formula: v_break_BC_2 InVars {} OutVars{break_BC=v_break_BC_2} AuxVars[] AssignedVars[break_BC]" "[93] L41-2-->L41: Formula: (and (< v_i_BC_1 v_Bn_3) (< v_i_BC_1 v_Cn_1) (not v_break_BC_1)) InVars {i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} OutVars{i_BC=v_i_BC_1, break_BC=v_break_BC_1, Bn=v_Bn_3, Cn=v_Cn_1} AuxVars[] AssignedVars[]" [2025-04-26 18:39:46,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1072030193, now seen corresponding path program 1 times [2025-04-26 18:39:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122481741] [2025-04-26 18:39:46,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:46,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:46,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:46,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 125178, now seen corresponding path program 1 times [2025-04-26 18:39:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596480886] [2025-04-26 18:39:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:46,038 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:46,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:46,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596480886] [2025-04-26 18:39:46,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596480886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:39:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185301562] [2025-04-26 18:39:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:46,043 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:39:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:46,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:39:46,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:39:46,044 INFO L87 Difference]: Start difference. First operand 1505 states and 3269 transitions. cyclomatic complexity: 1836 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:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:46,083 INFO L93 Difference]: Finished difference Result 2034 states and 4257 transitions. [2025-04-26 18:39:46,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2034 states and 4257 transitions. [2025-04-26 18:39:46,092 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 56 [2025-04-26 18:39:46,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2034 states to 1306 states and 2772 transitions. [2025-04-26 18:39:46,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-04-26 18:39:46,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2025-04-26 18:39:46,098 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1306 states and 2772 transitions. [2025-04-26 18:39:46,098 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:46,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1306 states and 2772 transitions. [2025-04-26 18:39:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states and 2772 transitions. [2025-04-26 18:39:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1090. [2025-04-26 18:39:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1090 states have (on average 2.1550458715596332) internal successors, (in total 2349), 1089 states have internal predecessors, (2349), 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:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2349 transitions. [2025-04-26 18:39:46,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1090 states and 2349 transitions. [2025-04-26 18:39:46,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:39:46,116 INFO L438 stractBuchiCegarLoop]: Abstraction has 1090 states and 2349 transitions. [2025-04-26 18:39:46,116 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:46,116 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1090 states and 2349 transitions. [2025-04-26 18:39:46,119 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 18:39:46,119 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:46,119 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:46,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:46,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:46,120 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L41-2-->thread2FINAL: Formula: (or (<= v_Bn_4 v_i_BC_6) (<= v_Cn_2 v_i_BC_6) v_break_BC_3) InVars {i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} OutVars{i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} AuxVars[] AssignedVars[]" "[94] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L72-->L56-2: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:39:46,120 INFO L754 eck$LassoCheckResult]: Loop: "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" "[103] L56-->L61: Formula: (not (= (select v_A_5 v_i_AC_8) (select v_C_5 v_i_AC_8))) InVars {A=v_A_5, i_AC=v_i_AC_8, C=v_C_5} OutVars{A=v_A_5, i_AC=v_i_AC_8, C=v_C_5} AuxVars[] AssignedVars[]" "[105] L61-->L56-2: Formula: v_break_AC_2 InVars {} OutVars{break_AC=v_break_AC_2} AuxVars[] AssignedVars[break_AC]" [2025-04-26 18:39:46,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash 571137634, now seen corresponding path program 1 times [2025-04-26 18:39:46,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761822905] [2025-04-26 18:39:46,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:46,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:46,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:46,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:46,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash 129189, now seen corresponding path program 1 times [2025-04-26 18:39:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859080272] [2025-04-26 18:39:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,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:46,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1899072860, now seen corresponding path program 1 times [2025-04-26 18:39:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569051040] [2025-04-26 18:39:46,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:46,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:46,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:46,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:46,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,301 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:46,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:46,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:46,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:46,301 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:46,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:46,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:46,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:39:46,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:46,301 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:46,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,449 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:46,449 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:46,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,453 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:46,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:39:46,454 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:46,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:46,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:46,468 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:46,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:46,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,475 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:46,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:39:46,477 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:46,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:46,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:46,492 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:46,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:39:46,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,499 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:46,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:39:46,501 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:46,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:46,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:46,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:46,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:46,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:46,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:46,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:46,520 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:46,520 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 18:39:46,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,522 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:46,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:39:46,525 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:46,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:39:46,544 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:46,544 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:46,544 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite break_AC 1 0)_4) = -2*v_rep(ite break_AC 1 0)_4 + 1 Supporting invariants [] [2025-04-26 18:39:46,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:39:46,550 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:46,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:46,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:46,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:46,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:46,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:46,582 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:46,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:46,592 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:46,593 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:46,593 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1090 states and 2349 transitions. cyclomatic complexity: 1318 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:46,628 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1090 states and 2349 transitions. cyclomatic complexity: 1318. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2841 states and 5963 transitions. Complement of second has 6 states. [2025-04-26 18:39:46,628 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:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-26 18:39:46,630 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:39:46,631 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:46,631 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:39:46,631 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:46,631 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 18:39:46,631 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:46,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2841 states and 5963 transitions. [2025-04-26 18:39:46,645 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:46,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2841 states to 2626 states and 5502 transitions. [2025-04-26 18:39:46,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2025-04-26 18:39:46,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 579 [2025-04-26 18:39:46,658 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2626 states and 5502 transitions. [2025-04-26 18:39:46,659 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:46,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 5502 transitions. [2025-04-26 18:39:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 5502 transitions. [2025-04-26 18:39:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2112. [2025-04-26 18:39:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 2112 states have (on average 2.113162878787879) internal successors, (in total 4463), 2111 states have internal predecessors, (4463), 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:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 4463 transitions. [2025-04-26 18:39:46,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2112 states and 4463 transitions. [2025-04-26 18:39:46,691 INFO L438 stractBuchiCegarLoop]: Abstraction has 2112 states and 4463 transitions. [2025-04-26 18:39:46,691 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:46,692 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2112 states and 4463 transitions. [2025-04-26 18:39:46,697 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:39:46,697 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:46,697 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:46,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:46,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:46,698 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->L71: Formula: (let ((.cse0 (not v_break_AB_4))) (and (= v_i_AB_8 0) (= v_i_BC_8 v_i_AB_8) (or (and v_break_AC_1 v_break_AB_4) (and (not v_break_AC_1) .cse0)) .cse0 (or (and (not v_break_BC_4) .cse0) (and v_break_BC_4 v_break_AB_4)) (= v_i_AC_2 v_i_AB_8))) InVars {i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} OutVars{i_AB=v_i_AB_8, i_BC=v_i_BC_8, i_AC=v_i_AC_2, break_AB=v_break_AB_4, break_BC=v_break_BC_4, break_AC=v_break_AC_1} AuxVars[] AssignedVars[]" "[108] L71-->L26-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[85] L26-2-->thread1FINAL: Formula: (or (<= v_Bn_2 v_i_AB_6) (<= v_An_2 v_i_AB_6) v_break_AB_3) InVars {i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} OutVars{i_AB=v_i_AB_6, break_AB=v_break_AB_3, Bn=v_Bn_2, An=v_An_2} AuxVars[] AssignedVars[]" "[87] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L71-1-->L41-2: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L41-2-->thread2FINAL: Formula: (or (<= v_Bn_4 v_i_BC_6) (<= v_Cn_2 v_i_BC_6) v_break_BC_3) InVars {i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} OutVars{i_BC=v_i_BC_6, break_BC=v_break_BC_3, Bn=v_Bn_4, Cn=v_Cn_2} AuxVars[] AssignedVars[]" "[94] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L72-->L56-2: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:46,699 INFO L754 eck$LassoCheckResult]: Loop: "[102] L56-->L57: Formula: (= (select v_A_4 v_i_AC_5) (select v_C_4 v_i_AC_5)) InVars {A=v_A_4, i_AC=v_i_AC_5, C=v_C_4} OutVars{A=v_A_4, i_AC=v_i_AC_5, C=v_C_4} AuxVars[] AssignedVars[]" "[104] L57-->L56-2: Formula: (= v_i_AC_6 (+ v_i_AC_7 1)) InVars {i_AC=v_i_AC_7} OutVars{i_AC=v_i_AC_6} AuxVars[] AssignedVars[i_AC]" "[100] L56-2-->L56: Formula: (and (< v_i_AC_4 v_An_5) (< v_i_AC_4 v_Cn_5) (not v_break_AC_4)) InVars {i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} OutVars{i_AC=v_i_AC_4, break_AC=v_break_AC_4, An=v_An_5, Cn=v_Cn_5} AuxVars[] AssignedVars[]" [2025-04-26 18:39:46,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 525397570, now seen corresponding path program 1 times [2025-04-26 18:39:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020040433] [2025-04-26 18:39:46,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:46,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:46,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:46,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 131137, now seen corresponding path program 1 times [2025-04-26 18:39:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357847182] [2025-04-26 18:39:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:46,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:46,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1258282592, now seen corresponding path program 1 times [2025-04-26 18:39:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:46,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339930003] [2025-04-26 18:39:46,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:46,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:46,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:46,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:46,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:46,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:46,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:46,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:46,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:46,867 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:46,867 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:46,867 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:46,867 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:46,867 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:46,867 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,867 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:46,867 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:46,867 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-eq-trans.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:46,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:46,868 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:46,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:46,987 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:46,987 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:46,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:46,989 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:46,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:39:46,991 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:47,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:47,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:47,005 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:47,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,011 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:39:47,013 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:47,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:47,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:47,026 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:47,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:39:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,034 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:39:47,044 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:47,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:47,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:47,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:47,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:47,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:47,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:47,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:47,074 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 18:39:47,074 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:47,077 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:47,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:39:47,078 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:47,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,095 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:47,095 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:47,095 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(Cn, i_AC) = 1*Cn - 1*i_AC Supporting invariants [] [2025-04-26 18:39:47,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:47,101 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:47,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:47,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:47,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:47,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:47,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:47,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:47,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:47,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:47,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:47,143 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:47,144 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:47,144 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2112 states and 4463 transitions. cyclomatic complexity: 2452 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,203 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2112 states and 4463 transitions. cyclomatic complexity: 2452. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6489 states and 13371 transitions. Complement of second has 6 states. [2025-04-26 18:39:47,203 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:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 18:39:47,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 18:39:47,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 12 letters. Loop has 3 letters. [2025-04-26 18:39:47,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 9 letters. Loop has 6 letters. [2025-04-26 18:39:47,206 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:47,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6489 states and 13371 transitions. [2025-04-26 18:39:47,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:47,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6489 states to 0 states and 0 transitions. [2025-04-26 18:39:47,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:47,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:47,236 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:47,236 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:47,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:47,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:47,236 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:47,236 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:47,236 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:47,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:47,236 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:47,248 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:47,249 INFO L201 PluginConnector]: Adding new model array-eq-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:47 BoogieIcfgContainer [2025-04-26 18:39:47,250 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:47,250 INFO L158 Benchmark]: Toolchain (without parser) took 4025.81ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 87.4MB in the beginning and 60.5MB in the end (delta: 26.9MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2025-04-26 18:39:47,251 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:47,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.91ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:47,251 INFO L158 Benchmark]: Boogie Preprocessor took 21.55ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.5MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:47,252 INFO L158 Benchmark]: RCFGBuilder took 174.25ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 74.3MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:47,252 INFO L158 Benchmark]: BuchiAutomizer took 3798.11ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.3MB in the beginning and 60.5MB in the end (delta: 13.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:47,253 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.15ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.91ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.55ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.5MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 174.25ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 74.3MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3798.11ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.3MB in the beginning and 60.5MB in the end (delta: 13.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1790 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 451 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 231 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp56 ukn87 mio100 lsp86 div100 bol100 ite100 ukn100 eq131 hnf96 smp100 dnf105 smp100 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 47ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 202, Number of transitions in reduction automaton: 641, Number of states in reduction automaton: 307, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 1 + -2 * (if break_AB then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function -1 * i_AB + Bn and consists of 4 locations. One deterministic module has affine ranking function Bn + -1 * i_BC and consists of 4 locations. One deterministic module has affine ranking function -2 * (if break_AC then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_AC + Cn and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:47,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...