/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/popl20/three-array-min.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:48,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:49,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:49,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:49,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:49,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:49,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:49,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:49,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:49,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:49,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:49,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:49,036 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:49,036 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:49,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:49,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:49,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:49,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:49,038 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:49,038 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:49,039 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:49,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:49,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:49,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:49,273 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:49,274 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:49,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl [2025-04-26 18:41:49,275 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl' [2025-04-26 18:41:49,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:49,300 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:49,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:49,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:49,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:49,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,334 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:49,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:49,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:49,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:49,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:49,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:49,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:49,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:49,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:49,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/1) ... [2025-04-26 18:41:49,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,398 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:41:49,403 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:41:49,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:49,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:49,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:49,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:49,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:49,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:49,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:49,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:49,423 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:41:49,467 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:49,470 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:49,553 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:49,554 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:49,580 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:49,580 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:49,581 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:49 BoogieIcfgContainer [2025-04-26 18:41:49,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:49,584 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:49,584 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:49,588 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:49,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:49,589 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:49" (1/2) ... [2025-04-26 18:41:49,590 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b2a2389 and model type three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:49, skipping insertion in model container [2025-04-26 18:41:49,590 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:49,590 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:49" (2/2) ... [2025-04-26 18:41:49,591 INFO L376 chiAutomizerObserver]: Analyzing ICFG three-array-min.wvr.bpl [2025-04-26 18:41:49,627 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:49,667 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:49,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,670 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:41:49,670 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:41:49,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2025-04-26 18:41:49,738 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 18:41:49,742 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:49,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 18:41:49,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2025-04-26 18:41:49,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-04-26 18:41:49,749 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 29 transitions, 76 flow [2025-04-26 18:41:49,750 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 29 transitions, 76 flow [2025-04-26 18:41:49,773 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 136 states, 134 states have (on average 2.970149253731343) internal successors, (in total 398), 135 states have internal predecessors, (398), 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:41:49,773 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 136 states, 134 states have (on average 2.970149253731343) internal successors, (in total 398), 135 states have internal predecessors, (398), 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:41:49,775 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:49,846 WARN L140 AmpleReduction]: Number of pruned transitions: 117 [2025-04-26 18:41:49,846 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:49,846 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 18:41:49,846 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:41:49,846 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:66 [2025-04-26 18:41:49,847 WARN L145 AmpleReduction]: Times succ was already a loop node:72 [2025-04-26 18:41:49,847 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:12 [2025-04-26 18:41:49,847 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:49,847 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 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:41:49,853 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:49,853 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:49,853 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:49,853 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:49,854 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:49,854 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:49,854 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:49,854 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:49,855 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 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:41:49,866 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 18:41:49,867 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,867 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:49,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:49,870 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:49,870 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 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:41:49,874 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 18:41:49,874 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,874 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:49,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:49,877 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_mina_3 (select v_A_3 0)) InVars {A=v_A_3, mina=v_mina_3} OutVars{A=v_A_3, mina=v_mina_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_minb_3) InVars {minb=v_minb_3, B=v_B_3} OutVars{minb=v_minb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_minc_1) InVars {A=v_A_4, minc=v_minc_1, B=v_B_4} OutVars{A=v_A_4, minc=v_minc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:49,878 INFO L754 eck$LassoCheckResult]: Loop: "[82] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L25-->L25-1: Formula: (and (= (let ((.cse0 (select v_A_5 v_i_13))) (ite (< v_mina_6 .cse0) v_mina_6 .cse0)) v_mina_5) (= (let ((.cse1 (select v_B_7 v_i_13))) (ite (< v_minb_10 .cse1) v_minb_10 .cse1)) v_minb_9) (= (+ v_i_13 1) v_i_12)) InVars {minb=v_minb_10, A=v_A_5, i=v_i_13, mina=v_mina_6, B=v_B_7} OutVars{minb=v_minb_9, A=v_A_5, i=v_i_12, mina=v_mina_5, B=v_B_7} AuxVars[] AssignedVars[minb, mina, i]" [2025-04-26 18:41:49,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1207410010, now seen corresponding path program 1 times [2025-04-26 18:41:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854026620] [2025-04-26 18:41:49,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:49,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:49,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:49,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:49,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-04-26 18:41:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671453531] [2025-04-26 18:41:49,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:49,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:49,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:49,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:49,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:49,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:49,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash -679847064, now seen corresponding path program 1 times [2025-04-26 18:41:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847474541] [2025-04-26 18:41:49,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:50,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:50,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:50,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:50,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,253 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:50,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:50,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:50,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:50,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:50,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:50,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:50,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:50,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:50,255 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:50,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,615 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:50,624 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:50,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,628 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:41:50,630 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:41:50,631 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:41:50,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,656 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 18:41:50,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,714 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 18:41:50,715 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 18:41:50,774 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,780 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:41:50,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,801 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:41:50,803 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:41:50,805 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:41:50,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:50,837 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:50,838 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:50,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,841 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:41:50,842 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:41:50,844 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:50,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:50,864 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:50,864 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:50,864 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:50,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:50,872 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:50,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:50,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:50,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:50,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:50,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,932 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:41:50,947 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:41:50,949 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 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 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:41:51,045 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 133 states, 131 states have (on average 2.045801526717557) internal successors, (in total 268), 132 states have internal predecessors, (268), 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 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 315 states and 658 transitions. Complement of second has 7 states. [2025-04-26 18:41:51,046 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:41:51,050 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:41:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-26 18:41:51,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:41:51,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,055 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:51,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,055 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:41:51,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 658 transitions. [2025-04-26 18:41:51,060 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 18:41:51,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 155 states and 317 transitions. [2025-04-26 18:41:51,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-04-26 18:41:51,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-04-26 18:41:51,067 INFO L74 IsDeterministic]: Start isDeterministic. Operand 155 states and 317 transitions. [2025-04-26 18:41:51,067 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:51,067 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 317 transitions. [2025-04-26 18:41:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 317 transitions. [2025-04-26 18:41:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2025-04-26 18:41:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 2.099236641221374) internal successors, (in total 275), 130 states have internal predecessors, (275), 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:41:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 275 transitions. [2025-04-26 18:41:51,089 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 18:41:51,089 INFO L438 stractBuchiCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 18:41:51,089 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:51,089 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 275 transitions. [2025-04-26 18:41:51,090 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 18:41:51,090 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:51,090 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:51,090 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:51,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:51,091 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_mina_3 (select v_A_3 0)) InVars {A=v_A_3, mina=v_mina_3} OutVars{A=v_A_3, mina=v_mina_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_minb_3) InVars {minb=v_minb_3, B=v_B_3} OutVars{minb=v_minb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_minc_1) InVars {A=v_A_4, minc=v_minc_1, B=v_B_4} OutVars{A=v_A_4, minc=v_minc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[83] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:51,091 INFO L754 eck$LassoCheckResult]: Loop: "[86] L37-1-->L37: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[88] L37-->L37-1: Formula: (and (= (store v_C_5 v_k_13 (+ (select v_B_9 v_k_13) (select v_A_7 v_k_13))) v_C_4) (= v_k_12 (+ v_k_13 1)) (= v_k_12 v_p_7)) InVars {A=v_A_7, k=v_k_13, C=v_C_5, B=v_B_9} OutVars{A=v_A_7, p=v_p_7, k=v_k_12, C=v_C_4, B=v_B_9} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 18:41:51,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 399576604, now seen corresponding path program 1 times [2025-04-26 18:41:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472393450] [2025-04-26 18:41:51,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-04-26 18:41:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654259076] [2025-04-26 18:41:51,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1741029854, now seen corresponding path program 1 times [2025-04-26 18:41:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66198083] [2025-04-26 18:41:51,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:51,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:51,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,198 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:41:51,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:51,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66198083] [2025-04-26 18:41:51,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66198083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:51,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996430905] [2025-04-26 18:41:51,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:51,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:51,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:51,230 INFO L87 Difference]: Start difference. First operand 131 states and 275 transitions. cyclomatic complexity: 171 Second operand has 4 states, 4 states have (on average 2.75) 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:41:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:51,290 INFO L93 Difference]: Finished difference Result 147 states and 297 transitions. [2025-04-26 18:41:51,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 297 transitions. [2025-04-26 18:41:51,291 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 57 [2025-04-26 18:41:51,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 297 transitions. [2025-04-26 18:41:51,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-04-26 18:41:51,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-04-26 18:41:51,297 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147 states and 297 transitions. [2025-04-26 18:41:51,297 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:51,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 297 transitions. [2025-04-26 18:41:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 297 transitions. [2025-04-26 18:41:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2025-04-26 18:41:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 2.074626865671642) internal successors, (in total 278), 133 states have internal predecessors, (278), 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:41:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 278 transitions. [2025-04-26 18:41:51,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 278 transitions. [2025-04-26 18:41:51,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:51,305 INFO L438 stractBuchiCegarLoop]: Abstraction has 134 states and 278 transitions. [2025-04-26 18:41:51,305 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:51,305 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 278 transitions. [2025-04-26 18:41:51,306 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 18:41:51,306 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:51,306 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:51,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:51,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:51,307 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_mina_3 (select v_A_3 0)) InVars {A=v_A_3, mina=v_mina_3} OutVars{A=v_A_3, mina=v_mina_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_minb_3) InVars {minb=v_minb_3, B=v_B_3} OutVars{minb=v_minb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_minc_1) InVars {A=v_A_4, minc=v_minc_1, B=v_B_4} OutVars{A=v_A_4, minc=v_minc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[82] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] L25-->L25-1: Formula: (and (= (let ((.cse0 (select v_A_5 v_i_13))) (ite (< v_mina_6 .cse0) v_mina_6 .cse0)) v_mina_5) (= (let ((.cse1 (select v_B_7 v_i_13))) (ite (< v_minb_10 .cse1) v_minb_10 .cse1)) v_minb_9) (= (+ v_i_13 1) v_i_12)) InVars {minb=v_minb_10, A=v_A_5, i=v_i_13, mina=v_mina_6, B=v_B_7} OutVars{minb=v_minb_9, A=v_A_5, i=v_i_12, mina=v_mina_5, B=v_B_7} AuxVars[] AssignedVars[minb, mina, i]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:51,307 INFO L754 eck$LassoCheckResult]: Loop: "[86] L37-1-->L37: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[88] L37-->L37-1: Formula: (and (= (store v_C_5 v_k_13 (+ (select v_B_9 v_k_13) (select v_A_7 v_k_13))) v_C_4) (= v_k_12 (+ v_k_13 1)) (= v_k_12 v_p_7)) InVars {A=v_A_7, k=v_k_13, C=v_C_5, B=v_B_9} OutVars{A=v_A_7, p=v_p_7, k=v_k_12, C=v_C_4, B=v_B_9} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 18:41:51,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,307 INFO L85 PathProgramCache]: Analyzing trace with hash -497981451, now seen corresponding path program 1 times [2025-04-26 18:41:51,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675110916] [2025-04-26 18:41:51,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:51,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:51,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:51,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:51,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 2 times [2025-04-26 18:41:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473319577] [2025-04-26 18:41:51,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:51,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1818801801, now seen corresponding path program 1 times [2025-04-26 18:41:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389025288] [2025-04-26 18:41:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:51,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:51,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:51,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:51,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,594 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:51,594 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:51,594 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:51,594 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:51,594 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:51,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:51,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:51,594 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:51,594 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:51,594 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:51,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:52,062 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:52,063 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:52,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:52,065 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:41:52,066 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:41:52,068 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:41:52,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:52,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:52,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:52,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:52,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:52,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:52,082 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:52,088 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:41:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:52,090 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:41:52,092 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:41:52,093 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:41:52,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:52,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:52,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:52,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:52,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:52,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:52,106 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:52,112 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:41:52,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:52,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:52,114 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:41:52,116 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:41:52,117 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:41:52,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:52,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:52,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:52,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:52,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:52,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:52,133 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:52,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:52,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:52,158 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:41:52,159 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:41:52,161 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:41:52,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:52,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:52,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:52,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:52,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:52,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:52,187 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:52,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:52,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:52,195 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:41:52,197 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:41:52,198 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:41:52,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:52,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:52,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:52,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:52,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:52,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:52,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:52,228 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:41:52,228 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:41:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:52,233 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:41:52,234 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:41:52,235 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:52,252 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:41:52,252 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:52,252 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:52,252 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:41:52,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:52,265 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:52,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:52,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:52,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:52,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:52,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:52,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:52,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:52,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:52,314 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:41:52,314 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:41:52,315 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 278 transitions. cyclomatic complexity: 171 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:52,397 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 278 transitions. cyclomatic complexity: 171. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 289 states and 610 transitions. Complement of second has 6 states. [2025-04-26 18:41:52,399 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:41:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:41:52,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:52,400 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:52,400 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:52,401 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:52,401 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:41:52,401 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:52,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 610 transitions. [2025-04-26 18:41:52,407 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:52,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 195 states and 400 transitions. [2025-04-26 18:41:52,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 18:41:52,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-04-26 18:41:52,409 INFO L74 IsDeterministic]: Start isDeterministic. Operand 195 states and 400 transitions. [2025-04-26 18:41:52,409 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:52,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 400 transitions. [2025-04-26 18:41:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 400 transitions. [2025-04-26 18:41:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2025-04-26 18:41:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 2.09375) internal successors, (in total 335), 159 states have internal predecessors, (335), 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:41:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 335 transitions. [2025-04-26 18:41:52,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 160 states and 335 transitions. [2025-04-26 18:41:52,415 INFO L438 stractBuchiCegarLoop]: Abstraction has 160 states and 335 transitions. [2025-04-26 18:41:52,415 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:52,415 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 335 transitions. [2025-04-26 18:41:52,416 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:52,416 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:52,416 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:52,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:52,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:52,417 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_mina_3 (select v_A_3 0)) InVars {A=v_A_3, mina=v_mina_3} OutVars{A=v_A_3, mina=v_mina_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_minb_3) InVars {minb=v_minb_3, B=v_B_3} OutVars{minb=v_minb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_minc_1) InVars {A=v_A_4, minc=v_minc_1, B=v_B_4} OutVars{A=v_A_4, minc=v_minc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[83] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] L37-1-->thread2FINAL: Formula: (<= v_N_3 v_k_1) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[87] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L68-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:52,417 INFO L754 eck$LassoCheckResult]: Loop: "[90] L49-1-->L49: Formula: (< v_l_2 v_N_6) InVars {l=v_l_2, N=v_N_6} OutVars{l=v_l_2, N=v_N_6} AuxVars[] AssignedVars[]" "[93] L49-->L49-1: Formula: (<= v_p_4 v_l_7) InVars {p=v_p_4, l=v_l_7} OutVars{p=v_p_4, l=v_l_7} AuxVars[] AssignedVars[]" [2025-04-26 18:41:52,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1862650263, now seen corresponding path program 1 times [2025-04-26 18:41:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:52,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174078142] [2025-04-26 18:41:52,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:52,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:52,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:52,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:52,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:52,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 3844, now seen corresponding path program 1 times [2025-04-26 18:41:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:52,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96658061] [2025-04-26 18:41:52,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:52,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:52,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:52,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:52,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:52,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:52,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:52,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash 994462572, now seen corresponding path program 1 times [2025-04-26 18:41:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:52,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692354246] [2025-04-26 18:41:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:52,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:52,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:52,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:52,468 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:41:52,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:52,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692354246] [2025-04-26 18:41:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692354246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267165643] [2025-04-26 18:41:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:52,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:52,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:52,486 INFO L87 Difference]: Start difference. First operand 160 states and 335 transitions. cyclomatic complexity: 203 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:41:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:52,524 INFO L93 Difference]: Finished difference Result 165 states and 340 transitions. [2025-04-26 18:41:52,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 340 transitions. [2025-04-26 18:41:52,525 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:52,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 159 states and 334 transitions. [2025-04-26 18:41:52,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2025-04-26 18:41:52,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2025-04-26 18:41:52,526 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 334 transitions. [2025-04-26 18:41:52,527 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:52,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 334 transitions. [2025-04-26 18:41:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 334 transitions. [2025-04-26 18:41:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-04-26 18:41:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.1082802547770703) internal successors, (in total 331), 156 states have internal predecessors, (331), 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:41:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 331 transitions. [2025-04-26 18:41:52,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 331 transitions. [2025-04-26 18:41:52,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:52,533 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 331 transitions. [2025-04-26 18:41:52,533 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:52,533 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 331 transitions. [2025-04-26 18:41:52,533 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:52,534 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:52,534 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:52,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:52,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:52,534 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 1) (= v_i_7 v_k_7) (= v_i_7 v_p_2)) InVars {i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} OutVars{i=v_i_7, p=v_p_2, l=v_l_1, k=v_k_7} AuxVars[] AssignedVars[]" "[55] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[67] L64-->L65: Formula: (= v_mina_3 (select v_A_3 0)) InVars {A=v_A_3, mina=v_mina_3} OutVars{A=v_A_3, mina=v_mina_3} AuxVars[] AssignedVars[]" "[79] L65-->L66: Formula: (= (select v_B_3 0) v_minb_3) InVars {minb=v_minb_3, B=v_B_3} OutVars{minb=v_minb_3, B=v_B_3} AuxVars[] AssignedVars[]" "[52] L66-->L67: Formula: (= (+ (select v_A_4 0) (select v_B_4 0)) v_minc_1) InVars {A=v_A_4, minc=v_minc_1, B=v_B_4} OutVars{A=v_A_4, minc=v_minc_1, B=v_B_4} AuxVars[] AssignedVars[]" "[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[82] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[84] L25-->L25-1: Formula: (and (= (let ((.cse0 (select v_A_5 v_i_13))) (ite (< v_mina_6 .cse0) v_mina_6 .cse0)) v_mina_5) (= (let ((.cse1 (select v_B_7 v_i_13))) (ite (< v_minb_10 .cse1) v_minb_10 .cse1)) v_minb_9) (= (+ v_i_13 1) v_i_12)) InVars {minb=v_minb_10, A=v_A_5, i=v_i_13, mina=v_mina_6, B=v_B_7} OutVars{minb=v_minb_9, A=v_A_5, i=v_i_12, mina=v_mina_5, B=v_B_7} AuxVars[] AssignedVars[minb, mina, i]" "[81] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[86] L37-1-->L37: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[103] L68-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:52,534 INFO L754 eck$LassoCheckResult]: Loop: "[90] L49-1-->L49: Formula: (< v_l_2 v_N_6) InVars {l=v_l_2, N=v_N_6} OutVars{l=v_l_2, N=v_N_6} AuxVars[] AssignedVars[]" "[93] L49-->L49-1: Formula: (<= v_p_4 v_l_7) InVars {p=v_p_4, l=v_l_7} OutVars{p=v_p_4, l=v_l_7} AuxVars[] AssignedVars[]" [2025-04-26 18:41:52,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1818801786, now seen corresponding path program 1 times [2025-04-26 18:41:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:52,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536084228] [2025-04-26 18:41:52,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:52,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:52,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:52,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:52,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:52,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:52,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:52,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:52,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash 3844, now seen corresponding path program 2 times [2025-04-26 18:41:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:52,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811539024] [2025-04-26 18:41:52,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:52,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:52,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:52,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:52,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:52,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:52,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:52,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:52,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash 183176009, now seen corresponding path program 1 times [2025-04-26 18:41:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:52,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381772513] [2025-04-26 18:41:52,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:52,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:52,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:52,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:52,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:52,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:52,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:52,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:52,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:52,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:52,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:52,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:52,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:52,781 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:41:52,791 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:52 BoogieIcfgContainer [2025-04-26 18:41:52,791 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:52,792 INFO L158 Benchmark]: Toolchain (without parser) took 3491.35ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 106.2MB in the beginning and 51.6MB in the end (delta: 54.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,792 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:52,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.08ms. Allocated memory is still 184.5MB. Free memory was 106.2MB in the beginning and 104.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:52,792 INFO L158 Benchmark]: Boogie Preprocessor took 30.50ms. Allocated memory is still 184.5MB. Free memory was 104.4MB in the beginning and 103.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,793 INFO L158 Benchmark]: RCFGBuilder took 211.61ms. Allocated memory is still 184.5MB. Free memory was 103.1MB in the beginning and 92.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,793 INFO L158 Benchmark]: BuchiAutomizer took 3206.71ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 92.3MB in the beginning and 51.6MB in the end (delta: 40.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,795 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.18ms. Allocated memory is still 184.5MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.08ms. Allocated memory is still 184.5MB. Free memory was 106.2MB in the beginning and 104.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.50ms. Allocated memory is still 184.5MB. Free memory was 104.4MB in the beginning and 103.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 211.61ms. Allocated memory is still 184.5MB. Free memory was 103.1MB in the beginning and 92.3MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3206.71ms. Allocated memory was 184.5MB in the beginning and 142.6MB in the end (delta: -41.9MB). Free memory was 92.3MB in the beginning and 51.6MB in the end (delta: 40.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 74 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 64 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital107 mio100 ax100 hnf100 lsp125 ukn49 mio100 lsp71 div100 bol100 ite100 ukn100 eq170 hnf95 smp100 dnf775 smp27 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 149ms VariablesStem: 5 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 184, Number of transitions in reduction automaton: 268, Number of states in reduction automaton: 133, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 157 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; VAL [i=1, k=1, l=1, p=1] [L63] 0 assume 0 <= N; VAL [N=2, i=1, k=1, l=1, p=1] [L64] 0 assume mina == A[0]; VAL [N=2, i=1, k=1, l=1, mina=46606, p=1] [L65] 0 assume minb == B[0]; VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, p=1] [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L24] COND TRUE 1 i < N VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L26] 1 mina := (if mina < A[i] then mina else A[i]); [L27] 1 minb := (if minb < B[i] then minb else B[i]); [L28] 1 i := i + 1; VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] [L24] COND FALSE 1 !(i < N) VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] [L36] COND TRUE 2 k < N VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; VAL [i=1, k=1, l=1, p=1] [L63] 0 assume 0 <= N; VAL [N=2, i=1, k=1, l=1, p=1] [L64] 0 assume mina == A[0]; VAL [N=2, i=1, k=1, l=1, mina=46606, p=1] [L65] 0 assume minb == B[0]; VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, p=1] [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L24] COND TRUE 1 i < N VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=46606, minb=26619, minc=73225, p=1] [L26] 1 mina := (if mina < A[i] then mina else A[i]); [L27] 1 minb := (if minb < B[i] then minb else B[i]); [L28] 1 i := i + 1; VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] [L24] COND FALSE 1 !(i < N) VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] [L36] COND TRUE 2 k < N VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=2, k=1, l=1, mina=46605, minb=26618, minc=73225, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:41:52,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...