/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:30:09,823 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:30:09,870 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:30:09,901 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:30:09,902 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:30:09,902 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:30:09,903 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:30:09,904 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:30:09,904 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:30:09,908 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:30:09,908 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:30:09,908 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:30:09,908 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:30:09,910 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:30:09,910 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:30:09,910 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:30:09,910 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:30:09,910 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:30:09,910 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:30:09,910 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:30:09,911 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:30:09,912 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:30:09,912 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:30:09,912 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:30:09,912 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:30:09,913 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:30:09,913 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:30:09,913 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:30:09,913 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:30:09,913 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:30:09,914 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:30:09,914 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:30:09,914 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:30:09,915 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:30:09,916 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:30:10,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:30:10,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:30:10,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:30:10,153 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:30:10,154 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:30:10,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl [2023-10-12 17:30:10,155 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl' [2023-10-12 17:30:10,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:30:10,178 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:30:10,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:10,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:30:10,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:30:10,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,203 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:30:10,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:10,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:30:10,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:30:10,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:30:10,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:30:10,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:30:10,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:30:10,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:30:10,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/1) ... [2023-10-12 17:30:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:10,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:30:10,290 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:30:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:30:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:30:10,290 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:30:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:30:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:30:10,291 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:30:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:30:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:30:10,291 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:30:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:30:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:30:10,292 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:30:10,333 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:30:10,335 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:30:10,421 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:30:10,436 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:30:10,437 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:30:10,439 INFO L201 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:10 BoogieIcfgContainer [2023-10-12 17:30:10,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:30:10,439 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:30:10,440 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:30:10,443 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:30:10,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:10,443 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:10" (1/2) ... [2023-10-12 17:30:10,445 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c2189b0 and model type sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:30:10, skipping insertion in model container [2023-10-12 17:30:10,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:10,445 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:10" (2/2) ... [2023-10-12 17:30:10,446 INFO L332 chiAutomizerObserver]: Analyzing ICFG sorted.wvr.bpl [2023-10-12 17:30:10,487 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:30:10,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:30:10,522 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:30:10,522 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:10,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:30:10,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:30:10,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:30:10,531 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:30:10,540 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:30:10,542 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:30:10,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:30:10,572 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:30:10,573 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:10,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:30:10,574 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:30:11,110 INFO L134 LiptonReduction]: Checked pairs total: 142 [2023-10-12 17:30:11,110 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:30:11,120 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:30:11,120 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:30:11,120 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:30:11,120 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:30:11,120 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:30:11,120 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:30:11,120 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:30:11,121 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:30:11,121 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:11,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:11,130 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:11,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:11,131 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:11,133 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:30:11,133 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:11,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:11,134 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:11,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:11,134 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:11,137 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[] 45#[L62]true [87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L62-1, L23-1]true [2023-10-12 17:30:11,137 INFO L750 eck$LassoCheckResult]: Loop: 47#[L62-1, L23-1]true [102] L23-1-->L23-1: Formula: (let ((.cse0 (+ v_i_16 1))) (and (= v_i_15 .cse0) (< .cse0 v_N_10) (let ((.cse2 (select v_A_12 v_i_16)) (.cse1 (select v_A_12 .cse0))) (or (and (or (not v_sorted1_12) (<= .cse1 .cse2)) (not v_sorted1_11)) (and v_sorted1_11 v_sorted1_12 (< .cse2 .cse1)))))) InVars {A=v_A_12, N=v_N_10, i=v_i_16, sorted1=v_sorted1_12} OutVars{A=v_A_12, N=v_N_10, i=v_i_15, sorted1=v_sorted1_11} AuxVars[] AssignedVars[i, sorted1] 47#[L62-1, L23-1]true [2023-10-12 17:30:11,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 4489, now seen corresponding path program 1 times [2023-10-12 17:30:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460709659] [2023-10-12 17:30:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash 133, now seen corresponding path program 1 times [2023-10-12 17:30:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738317108] [2023-10-12 17:30:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 139261, now seen corresponding path program 1 times [2023-10-12 17:30:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709536788] [2023-10-12 17:30:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:11,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,464 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:11,465 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:11,465 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:11,465 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:11,466 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:11,466 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,466 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:11,466 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:11,466 INFO L133 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:30:11,466 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:11,466 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:11,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:11,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:11,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:11,541 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:11,543 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:11,647 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:11,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:11,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:11,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:30:11,679 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 [2023-10-12 17:30:11,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:11,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:11,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:30:11,733 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 [2023-10-12 17:30:11,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:30:11,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:11,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:30:11,766 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 [2023-10-12 17:30:11,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:11,837 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-10-12 17:30:11,837 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:30:11,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:11,878 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:11,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:30:11,897 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:11,897 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:11,898 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:30:11,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:11,910 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:11,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:11,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:11,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:11,962 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:11,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:11,988 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:30:11,989 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:12,100 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 292 transitions. [2023-10-12 17:30:12,102 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:12,106 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:30:12,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:30:12,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:30:12,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:30:12,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:12,142 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:30:12,142 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:30:12,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 545 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:30:12,144 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:12,147 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:12,147 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:12,147 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:30:12,147 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:12,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:12,152 INFO L124 PetriNetUnfolderBase]: 25/38 cut-off events. [2023-10-12 17:30:12,154 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:30:12,154 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:12,154 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[] 45#[L62]true [87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L62-1, L23-1]true [90] L62-1-->L34-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] 96#[L23-1, L63, L34-1]true [2023-10-12 17:30:12,154 INFO L750 eck$LassoCheckResult]: Loop: 96#[L23-1, L63, L34-1]true [100] L34-1-->L34-1: Formula: (let ((.cse0 (+ v_j_16 1))) (and (= v_j_15 .cse0) (let ((.cse2 (select v_A_10 .cse0)) (.cse1 (select v_A_10 v_j_16))) (or (and (< .cse1 .cse2) v_sorted2_11 v_sorted2_12) (and (or (<= .cse2 .cse1) (not v_sorted2_12)) (not v_sorted2_11)))) (< v_j_16 v_M_10))) InVars {A=v_A_10, M=v_M_10, j=v_j_16, sorted2=v_sorted2_12} OutVars{A=v_A_10, M=v_M_10, j=v_j_15, sorted2=v_sorted2_11} AuxVars[] AssignedVars[j, sorted2] 96#[L23-1, L63, L34-1]true [100] L34-1-->L34-1: Formula: (let ((.cse0 (+ v_j_16 1))) (and (= v_j_15 .cse0) (let ((.cse2 (select v_A_10 .cse0)) (.cse1 (select v_A_10 v_j_16))) (or (and (< .cse1 .cse2) v_sorted2_11 v_sorted2_12) (and (or (<= .cse2 .cse1) (not v_sorted2_12)) (not v_sorted2_11)))) (< v_j_16 v_M_10))) InVars {A=v_A_10, M=v_M_10, j=v_j_16, sorted2=v_sorted2_12} OutVars{A=v_A_10, M=v_M_10, j=v_j_15, sorted2=v_sorted2_11} AuxVars[] AssignedVars[j, sorted2] 96#[L23-1, L63, L34-1]true [2023-10-12 17:30:12,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash 139249, now seen corresponding path program 1 times [2023-10-12 17:30:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716159800] [2023-10-12 17:30:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:12,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 4161, now seen corresponding path program 1 times [2023-10-12 17:30:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659153356] [2023-10-12 17:30:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:12,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash 133821489, now seen corresponding path program 1 times [2023-10-12 17:30:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:12,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843971617] [2023-10-12 17:30:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:12,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:12,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:12,430 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:12,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:12,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:12,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:12,431 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:12,431 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:12,431 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:12,431 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:12,431 INFO L133 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:30:12,431 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:12,431 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:12,434 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,497 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,499 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:12,622 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:12,624 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:12,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:12,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:30:12,629 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 [2023-10-12 17:30:12,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:12,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:12,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:12,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:12,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:12,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:12,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:12,662 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:30:12,663 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:30:12,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:12,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:12,664 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:12,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:30:12,667 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:12,674 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:12,674 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:12,674 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:30:12,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:12,682 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:12,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:12,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:12,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:12,704 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:12,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:12,715 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 [2023-10-12 17:30:12,715 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:12,836 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 384 transitions. [2023-10-12 17:30:12,836 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:12,858 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2023-10-12 17:30:12,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:30:12,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:30:12,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:30:12,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:12,969 INFO L124 PetriNetUnfolderBase]: 383/568 cut-off events. [2023-10-12 17:30:12,969 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-10-12 17:30:12,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 568 events. 383/568 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2002 event pairs, 26 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1278. Up to 202 conditions per place. [2023-10-12 17:30:12,972 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:13,010 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:13,011 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:13,011 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:30:13,012 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:13,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:13,046 INFO L124 PetriNetUnfolderBase]: 152/214 cut-off events. [2023-10-12 17:30:13,046 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:30:13,046 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:13,046 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[] 45#[L62]true [87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L62-1, L23-1]true [90] L62-1-->L34-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] 96#[L23-1, L63, L34-1]true [102] L23-1-->L23-1: Formula: (let ((.cse0 (+ v_i_16 1))) (and (= v_i_15 .cse0) (< .cse0 v_N_10) (let ((.cse2 (select v_A_12 v_i_16)) (.cse1 (select v_A_12 .cse0))) (or (and (or (not v_sorted1_12) (<= .cse1 .cse2)) (not v_sorted1_11)) (and v_sorted1_11 v_sorted1_12 (< .cse2 .cse1)))))) InVars {A=v_A_12, N=v_N_10, i=v_i_16, sorted1=v_sorted1_12} OutVars{A=v_A_12, N=v_N_10, i=v_i_15, sorted1=v_sorted1_11} AuxVars[] AssignedVars[i, sorted1] 96#[L23-1, L63, L34-1]true [93] L63-->L45-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] 155#[L23-1, L34-1, L64, L45-1]true [2023-10-12 17:30:13,047 INFO L750 eck$LassoCheckResult]: Loop: 155#[L23-1, L34-1, L64, L45-1]true [106] L45-1-->L45-1: Formula: (let ((.cse0 (+ v_k_14 1))) (and (= v_k_13 .cse0) (let ((.cse2 (select v_A_14 v_k_14)) (.cse1 (select v_A_14 .cse0))) (or (and (or (<= .cse1 .cse2) (not v_sorted3_12)) (not v_sorted3_11)) (and v_sorted3_11 v_sorted3_12 (< .cse2 .cse1)))) (< .cse0 v_N_14))) InVars {A=v_A_14, N=v_N_14, k=v_k_14, sorted3=v_sorted3_12} OutVars{A=v_A_14, N=v_N_14, k=v_k_13, sorted3=v_sorted3_11} AuxVars[] AssignedVars[k, sorted3] 155#[L23-1, L34-1, L64, L45-1]true [106] L45-1-->L45-1: Formula: (let ((.cse0 (+ v_k_14 1))) (and (= v_k_13 .cse0) (let ((.cse2 (select v_A_14 v_k_14)) (.cse1 (select v_A_14 .cse0))) (or (and (or (<= .cse1 .cse2) (not v_sorted3_12)) (not v_sorted3_11)) (and v_sorted3_11 v_sorted3_12 (< .cse2 .cse1)))) (< .cse0 v_N_14))) InVars {A=v_A_14, N=v_N_14, k=v_k_14, sorted3=v_sorted3_12} OutVars{A=v_A_14, N=v_N_14, k=v_k_13, sorted3=v_sorted3_11} AuxVars[] AssignedVars[k, sorted3] 155#[L23-1, L34-1, L64, L45-1]true [2023-10-12 17:30:13,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash 133821544, now seen corresponding path program 1 times [2023-10-12 17:30:13,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:13,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448757812] [2023-10-12 17:30:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:13,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:13,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 4353, now seen corresponding path program 1 times [2023-10-12 17:30:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953528327] [2023-10-12 17:30:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:13,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -246511704, now seen corresponding path program 1 times [2023-10-12 17:30:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096598586] [2023-10-12 17:30:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:13,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:13,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:13,361 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:13,361 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:13,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:13,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:13,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:13,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:13,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:13,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:13,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:30:13,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:13,362 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:13,363 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,365 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,466 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:13,645 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:13,646 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:13,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:13,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:30:13,650 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 [2023-10-12 17:30:13,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:13,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:13,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:13,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:13,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:13,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:13,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:13,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:13,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:13,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:13,688 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:30:13,692 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 [2023-10-12 17:30:13,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:13,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:13,699 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:30:13,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:13,721 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:30:13,722 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:30:13,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:13,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:13,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:13,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:13,781 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:13,792 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 [2023-10-12 17:30:13,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:13,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:13,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:13,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:13,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:13,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:13,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:30:13,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:13,827 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:30:13,827 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:30:13,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:13,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:13,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:30:13,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:30:13,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:13,861 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:13,861 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:13,861 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:30:13,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:13,870 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:13,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:13,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:13,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:13,899 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:13,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:13,908 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 [2023-10-12 17:30:13,908 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:14,014 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 385 transitions. [2023-10-12 17:30:14,014 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:14,345 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:14,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2023-10-12 17:30:14,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:30:14,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:14,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:30:14,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:14,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:30:14,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:14,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 39760 transitions, 373376 flow [2023-10-12 17:30:16,479 INFO L124 PetriNetUnfolderBase]: 848/1254 cut-off events. [2023-10-12 17:30:16,479 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2023-10-12 17:30:16,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 1254 events. 848/1254 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5317 event pairs, 15 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 3144. Up to 458 conditions per place. [2023-10-12 17:30:16,480 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 39760 transitions, 373376 flow [2023-10-12 17:30:16,918 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 39760 transitions, 373376 flow [2023-10-12 17:30:16,919 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 39760 transitions, 373376 flow [2023-10-12 17:30:16,919 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:30:16,919 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 39760 transitions, 373376 flow [2023-10-12 17:30:19,079 INFO L124 PetriNetUnfolderBase]: 848/1254 cut-off events. [2023-10-12 17:30:19,079 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2023-10-12 17:30:19,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:30:19,083 INFO L201 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:19 BoogieIcfgContainer [2023-10-12 17:30:19,084 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:19,084 INFO L158 Benchmark]: Toolchain (without parser) took 8905.94ms. Allocated memory was 177.2MB in the beginning and 454.0MB in the end (delta: 276.8MB). Free memory was 125.1MB in the beginning and 123.7MB in the end (delta: 1.4MB). Peak memory consumption was 347.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:19,084 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 177.2MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:19,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.58ms. Allocated memory is still 177.2MB. Free memory was 125.1MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:30:19,085 INFO L158 Benchmark]: Boogie Preprocessor took 15.38ms. Allocated memory is still 177.2MB. Free memory was 123.5MB in the beginning and 122.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:19,085 INFO L158 Benchmark]: RCFGBuilder took 218.16ms. Allocated memory is still 177.2MB. Free memory was 122.4MB in the beginning and 111.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:19,086 INFO L158 Benchmark]: BuchiAutomizer took 8644.26ms. Allocated memory was 177.2MB in the beginning and 454.0MB in the end (delta: 276.8MB). Free memory was 111.8MB in the beginning and 123.7MB in the end (delta: -11.9MB). Peak memory consumption was 332.9MB. Max. memory is 8.0GB. [2023-10-12 17:30:19,087 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.21ms. Allocated memory is still 177.2MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.58ms. Allocated memory is still 177.2MB. Free memory was 125.1MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.38ms. Allocated memory is still 177.2MB. Free memory was 123.5MB in the beginning and 122.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 218.16ms. Allocated memory is still 177.2MB. Free memory was 122.4MB in the beginning and 111.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 8644.26ms. Allocated memory was 177.2MB in the beginning and 454.0MB in the end (delta: 276.8MB). Free memory was 111.8MB in the beginning and 123.7MB in the end (delta: -11.9MB). Peak memory consumption was 332.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 170 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital93 mio100 ax100 hnf100 lsp160 ukn40 mio100 lsp52 div100 bol131 ite100 ukn100 eq114 hnf95 smp100 dnf286 smp48 tf100 neg100 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 81ms VariablesStem: 1 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 36 PlacesBefore, 22 PlacesAfterwards, 29 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 142 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:30:19,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...