Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r359-smll-167891809000467.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ServersAndClients-PT-100040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891809000467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 03:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 03:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-100040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679118314646

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100040
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 05:45:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 05:45:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 05:45:18] [INFO ] Load time of PNML (sax parser for PT used): 712 ms
[2023-03-18 05:45:18] [INFO ] Transformed 4441 places.
[2023-03-18 05:45:18] [INFO ] Transformed 8200 transitions.
[2023-03-18 05:45:18] [INFO ] Parsed PT model containing 4441 places and 8200 transitions and 24800 arcs in 995 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-100040-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 1208 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2023-03-18 05:45:20] [INFO ] Computed 241 place invariants in 175 ms
[2023-03-18 05:45:22] [INFO ] Implicit Places using invariants in 2530 ms returned []
[2023-03-18 05:45:22] [INFO ] Invariant cache hit.
[2023-03-18 05:45:24] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 4356 ms to find 0 implicit places.
[2023-03-18 05:45:24] [INFO ] Invariant cache hit.
[2023-03-18 05:45:25] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6442 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Support contains 56 out of 4441 places after structural reductions.
[2023-03-18 05:45:26] [INFO ] Flatten gal took : 600 ms
[2023-03-18 05:45:26] [INFO ] Flatten gal took : 364 ms
[2023-03-18 05:45:27] [INFO ] Input system was already deterministic with 8200 transitions.
Support contains 55 out of 4441 places (down from 56) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=9 ) properties (out of 33) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-18 05:45:29] [INFO ] Invariant cache hit.
[2023-03-18 05:45:32] [INFO ] After 3339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-18 05:45:35] [INFO ] [Nat]Absence check using 141 positive place invariants in 402 ms returned sat
[2023-03-18 05:45:35] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 125 ms returned sat
[2023-03-18 05:45:46] [INFO ] After 9392ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :8
[2023-03-18 05:45:52] [INFO ] After 15411ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :8
Attempting to minimize the solution found.
Minimization took 3733 ms.
[2023-03-18 05:45:56] [INFO ] After 23636ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :8
Fused 19 Parikh solutions to 8 different solutions.
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 8 properties in 95 ms.
FORMULA ServersAndClients-PT-100040-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ServersAndClients-PT-100040-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 5 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 883 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2023-03-18 05:45:57] [INFO ] Invariant cache hit.
[2023-03-18 05:45:58] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-18 05:45:58] [INFO ] Invariant cache hit.
[2023-03-18 05:45:59] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2023-03-18 05:45:59] [INFO ] Invariant cache hit.
[2023-03-18 05:46:08] [INFO ] Dead Transitions using invariants and state equation in 8663 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11392 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT s3494 s2657), p0:(OR (GT 1 s4020) (GT s4055 s4256))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31819 steps with 0 reset in 945 ms.
FORMULA ServersAndClients-PT-100040-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLCardinality-05 finished in 12780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U p2)))'
Support contains 6 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3995 transitions
Trivial Post-agglo rules discarded 3995 transitions
Performed 3995 trivial Post agglomeration. Transition count delta: 3995
Iterating post reduction 0 with 3995 rules applied. Total rules applied 3995 place count 4441 transition count 4205
Reduce places removed 4030 places and 0 transitions.
Ensure Unique test removed 3400 transitions
Reduce isomorphic transitions removed 3400 transitions.
Iterating post reduction 1 with 7430 rules applied. Total rules applied 11425 place count 411 transition count 805
Drop transitions removed 495 transitions
Redundant transition composition rules discarded 495 transitions
Iterating global reduction 2 with 495 rules applied. Total rules applied 11920 place count 411 transition count 310
Discarding 94 places :
Implicit places reduction removed 94 places
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 2 with 282 rules applied. Total rules applied 12202 place count 317 transition count 122
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 3 with 375 rules applied. Total rules applied 12577 place count 35 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 12577 place count 35 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 12580 place count 33 transition count 28
Applied a total of 12580 rules in 187 ms. Remains 33 /4441 variables (removed 4408) and now considering 28/8200 (removed 8172) transitions.
// Phase 1: matrix 28 rows 33 cols
[2023-03-18 05:46:09] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-18 05:46:09] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 23, 25, 27, 29, 31]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/4441 places, 28/8200 transitions.
Graph (trivial) has 16 edges and 17 vertex of which 11 / 17 are part of one of the 1 SCC in 4 ms
Free SCC test removed 10 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Applied a total of 1 rules in 7 ms. Remains 7 /17 variables (removed 10) and now considering 13/28 (removed 15) transitions.
// Phase 1: matrix 13 rows 7 cols
[2023-03-18 05:46:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 05:46:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 05:46:09] [INFO ] Invariant cache hit.
[2023-03-18 05:46:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/4441 places, 13/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 7/4441 places, 13/8200 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(LEQ s2 s5), p1:(LEQ s4 s6), p0:(GT s0 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLCardinality-06 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 865 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2023-03-18 05:46:11] [INFO ] Computed 241 place invariants in 107 ms
[2023-03-18 05:46:12] [INFO ] Implicit Places using invariants in 1879 ms returned []
[2023-03-18 05:46:12] [INFO ] Invariant cache hit.
[2023-03-18 05:46:14] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 3804 ms to find 0 implicit places.
[2023-03-18 05:46:14] [INFO ] Invariant cache hit.
[2023-03-18 05:46:15] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5613 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s2398 s3282), p1:(GT 1 s3973)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4397 ms.
Product exploration explored 100000 steps with 50000 reset in 3785 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100040-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100040-LTLCardinality-10 finished in 14189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 749 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2023-03-18 05:46:25] [INFO ] Invariant cache hit.
[2023-03-18 05:46:26] [INFO ] Implicit Places using invariants in 1688 ms returned []
[2023-03-18 05:46:26] [INFO ] Invariant cache hit.
[2023-03-18 05:46:27] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
[2023-03-18 05:46:27] [INFO ] Invariant cache hit.
[2023-03-18 05:46:36] [INFO ] Dead Transitions using invariants and state equation in 8582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11963 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ServersAndClients-PT-100040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s1867 s2699), p1:(LEQ 1 s68)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33120 reset in 3416 ms.
Product exploration explored 100000 steps with 33035 reset in 3891 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 05:46:45] [INFO ] Invariant cache hit.
[2023-03-18 05:46:45] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 05:46:46] [INFO ] [Nat]Absence check using 141 positive place invariants in 251 ms returned sat
[2023-03-18 05:46:46] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 110 ms returned sat
[2023-03-18 05:46:46] [INFO ] After 1023ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 649 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 995 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2023-03-18 05:46:48] [INFO ] Invariant cache hit.
[2023-03-18 05:46:50] [INFO ] Implicit Places using invariants in 1866 ms returned []
[2023-03-18 05:46:50] [INFO ] Invariant cache hit.
[2023-03-18 05:46:52] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2023-03-18 05:46:52] [INFO ] Invariant cache hit.
[2023-03-18 05:47:01] [INFO ] Dead Transitions using invariants and state equation in 9555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14166 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 05:47:02] [INFO ] Invariant cache hit.
[2023-03-18 05:47:03] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 05:47:05] [INFO ] [Nat]Absence check using 141 positive place invariants in 246 ms returned sat
[2023-03-18 05:47:05] [INFO ] [Nat]Absence check using 141 positive and 100 generalized place invariants in 91 ms returned sat
[2023-03-18 05:47:10] [INFO ] After 5388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 05:47:11] [INFO ] After 5905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 421 ms.
[2023-03-18 05:47:11] [INFO ] After 7611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 331 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 33071 reset in 3246 ms.
Product exploration explored 100000 steps with 33099 reset in 3386 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Performed 3998 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3998 rules applied. Total rules applied 3998 place count 4441 transition count 8200
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 4035 place count 4404 transition count 4500
Deduced a syphon composed of 3998 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 4072 place count 4404 transition count 4500
Discarding 3700 places :
Symmetric choice reduction at 1 with 3700 rule applications. Total rules 7772 place count 704 transition count 800
Deduced a syphon composed of 298 places in 0 ms
Iterating global reduction 1 with 3700 rules applied. Total rules applied 11472 place count 704 transition count 800
Deduced a syphon composed of 298 places in 0 ms
Applied a total of 11472 rules in 2441 ms. Remains 704 /4441 variables (removed 3737) and now considering 800/8200 (removed 7400) transitions.
[2023-03-18 05:47:21] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-18 05:47:21] [INFO ] Flow matrix only has 602 transitions (discarded 198 similar events)
// Phase 1: matrix 602 rows 704 cols
[2023-03-18 05:47:21] [INFO ] Computed 204 place invariants in 13 ms
[2023-03-18 05:47:22] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 704/4441 places, 800/8200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3488 ms. Remains : 704/4441 places, 800/8200 transitions.
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 602 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2023-03-18 05:47:23] [INFO ] Computed 241 place invariants in 86 ms
[2023-03-18 05:47:25] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2023-03-18 05:47:25] [INFO ] Invariant cache hit.
[2023-03-18 05:47:26] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 3238 ms to find 0 implicit places.
[2023-03-18 05:47:26] [INFO ] Invariant cache hit.
[2023-03-18 05:47:36] [INFO ] Dead Transitions using invariants and state equation in 9558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13400 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Treatment of property ServersAndClients-PT-100040-LTLCardinality-11 finished in 72703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(G(p1) U G((p2&&F(G(p3))))))))'
Support contains 8 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3993 transitions
Trivial Post-agglo rules discarded 3993 transitions
Performed 3993 trivial Post agglomeration. Transition count delta: 3993
Iterating post reduction 0 with 3993 rules applied. Total rules applied 3993 place count 4441 transition count 4207
Reduce places removed 4026 places and 0 transitions.
Ensure Unique test removed 3200 transitions
Reduce isomorphic transitions removed 3200 transitions.
Iterating post reduction 1 with 7226 rules applied. Total rules applied 11219 place count 415 transition count 1007
Drop transitions removed 693 transitions
Redundant transition composition rules discarded 693 transitions
Iterating global reduction 2 with 693 rules applied. Total rules applied 11912 place count 415 transition count 314
Discarding 92 places :
Implicit places reduction removed 92 places
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 2 with 276 rules applied. Total rules applied 12188 place count 323 transition count 130
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 3 with 367 rules applied. Total rules applied 12555 place count 47 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 12555 place count 47 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 12558 place count 45 transition count 38
Applied a total of 12558 rules in 129 ms. Remains 45 /4441 variables (removed 4396) and now considering 38/8200 (removed 8162) transitions.
// Phase 1: matrix 38 rows 45 cols
[2023-03-18 05:47:37] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-18 05:47:37] [INFO ] Implicit Places using invariants in 73 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 31, 33, 35, 37, 39, 41, 43]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 82 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/4441 places, 38/8200 transitions.
Graph (trivial) has 22 edges and 23 vertex of which 15 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Applied a total of 1 rules in 2 ms. Remains 9 /23 variables (removed 14) and now considering 17/38 (removed 21) transitions.
// Phase 1: matrix 17 rows 9 cols
[2023-03-18 05:47:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 05:47:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 05:47:37] [INFO ] Invariant cache hit.
[2023-03-18 05:47:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/4441 places, 17/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 9/4441 places, 17/8200 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (AND p2 (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s4 s5), p2:(LEQ s3 s0), p1:(LEQ s7 s8), p3:(GT s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLCardinality-13 finished in 658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Found a Lengthening insensitive property : ServersAndClients-PT-100040-LTLCardinality-11
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3998 transitions
Trivial Post-agglo rules discarded 3998 transitions
Performed 3998 trivial Post agglomeration. Transition count delta: 3998
Iterating post reduction 0 with 3998 rules applied. Total rules applied 3998 place count 4441 transition count 4202
Reduce places removed 4036 places and 0 transitions.
Ensure Unique test removed 3700 transitions
Reduce isomorphic transitions removed 3700 transitions.
Iterating post reduction 1 with 7736 rules applied. Total rules applied 11734 place count 405 transition count 502
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 11932 place count 405 transition count 304
Discarding 98 places :
Implicit places reduction removed 98 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 2 with 292 rules applied. Total rules applied 12224 place count 307 transition count 110
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 388 rules applied. Total rules applied 12612 place count 16 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 12613 place count 15 transition count 13
Applied a total of 12613 rules in 113 ms. Remains 15 /4441 variables (removed 4426) and now considering 13/8200 (removed 8187) transitions.
// Phase 1: matrix 13 rows 15 cols
[2023-03-18 05:47:38] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-18 05:47:38] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 3, 4, 11, 13]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/4441 places, 13/8200 transitions.
Graph (trivial) has 7 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 1 ms. Remains 5 /9 variables (removed 4) and now considering 7/13 (removed 6) transitions.
// Phase 1: matrix 7 rows 5 cols
[2023-03-18 05:47:38] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 05:47:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 05:47:38] [INFO ] Invariant cache hit.
[2023-03-18 05:47:38] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 5/4441 places, 7/8200 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 198 ms. Remains : 5/4441 places, 7/8200 transitions.
Running random walk in product with property : ServersAndClients-PT-100040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3 s4), p1:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31543 reset in 281 ms.
Product exploration explored 100000 steps with 31360 reset in 294 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 419 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 05:47:39] [INFO ] Invariant cache hit.
[2023-03-18 05:47:39] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 05:47:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 05:47:39] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 592 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-18 05:47:40] [INFO ] Invariant cache hit.
[2023-03-18 05:47:40] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 05:47:40] [INFO ] Invariant cache hit.
[2023-03-18 05:47:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 05:47:40] [INFO ] Invariant cache hit.
[2023-03-18 05:47:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 5/5 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 335 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 31502 reset in 123 ms.
Product exploration explored 100000 steps with 31493 reset in 137 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-18 05:47:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 05:47:42] [INFO ] Invariant cache hit.
[2023-03-18 05:47:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 5/5 places, 7/7 transitions.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-18 05:47:42] [INFO ] Invariant cache hit.
[2023-03-18 05:47:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 05:47:42] [INFO ] Invariant cache hit.
[2023-03-18 05:47:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-18 05:47:42] [INFO ] Invariant cache hit.
[2023-03-18 05:47:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 5/5 places, 7/7 transitions.
Treatment of property ServersAndClients-PT-100040-LTLCardinality-11 finished in 4995 ms.
[2023-03-18 05:47:43] [INFO ] Flatten gal took : 428 ms
[2023-03-18 05:47:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-18 05:47:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4441 places, 8200 transitions and 24800 arcs took 88 ms.
Total runtime 145467 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ServersAndClients-PT-100040
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA ServersAndClients-PT-100040-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679118467021

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 ServersAndClients-PT-100040-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SKEL/SRCH) for ServersAndClients-PT-100040-LTLCardinality-11
lola: result : true
lola: markings : 22
lola: fired transitions : 33
lola: time used : 0.000000
lola: memory pages used : 1
lola: planning for (null) stopped (result already fixed).
lola: LAUNCH task # 3 (type EXCL) for 0 ServersAndClients-PT-100040-LTLCardinality-11
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for ServersAndClients-PT-100040-LTLCardinality-11
lola: result : true
lola: markings : 3
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ServersAndClients-PT-100040-LTLCardinality-11: CONJ true CONJ


Time elapsed: 3 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ServersAndClients-PT-100040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ServersAndClients-PT-100040, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r359-smll-167891809000467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100040.tgz
mv ServersAndClients-PT-100040 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;