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.r165-tall-167838851000859.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 itstools
Input is GPPP-PT-C0100N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838851000859
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0100N0000001000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679596700635

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000001000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-23 18:38:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 18:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:38:22] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 18:38:22] [INFO ] Transformed 33 places.
[2023-03-23 18:38:22] [INFO ] Transformed 22 transitions.
[2023-03-23 18:38:22] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 15 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 18:38:22] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-23 18:38:22] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
[2023-03-23 18:38:22] [INFO ] Invariant cache hit.
[2023-03-23 18:38:22] [INFO ] Implicit Places using invariants in 33 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 211 ms. Remains : 31/33 places, 22/22 transitions.
Support contains 26 out of 31 places after structural reductions.
[2023-03-23 18:38:22] [INFO ] Flatten gal took : 17 ms
[2023-03-23 18:38:22] [INFO ] Flatten gal took : 5 ms
[2023-03-23 18:38:22] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10381 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=146 ) properties (out of 29) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 18:38:23] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-23 18:38:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:38:23] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:38:23] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-23 18:38:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 18:38:23] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 18:38:23] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
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(G((G(p0) U (p1&&X(G((p1||G(p2)))))))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:38:23] [INFO ] Invariant cache hit.
[2023-03-23 18:38:23] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-23 18:38:23] [INFO ] Invariant cache hit.
[2023-03-23 18:38:23] [INFO ] Implicit Places using invariants in 27 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 871 ms :[(NOT p1), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=6 dest: 9}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=9 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=9 dest: 9}, { cond=(AND p1 p0 p2), acceptance={1} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=10 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={1} source=10 dest: 9}, { cond=(AND p1 p0 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(GT s21 s24), p0:(OR (LEQ s10 s24) (LEQ 2 s7)), p2:(LEQ s18 s8)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 211 ms.
Product exploration explored 100000 steps with 34 reset in 153 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 (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (X (AND (NOT p1) p0))), (X (X (OR (AND p1 p0) (AND p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1173 ms. Reduced automaton from 11 states, 50 edges and 3 AP (stutter sensitive) to 11 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10377 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=494 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 29 cols
[2023-03-23 18:38:26] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 18:38:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 18:38:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:38:26] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 18:38:26] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 18:38:26] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-23 18:38:27] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 629 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=209 )
Parikh walk visited 3 properties in 14 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (X (AND (NOT p1) p0))), (X (X (OR (AND p1 p0) (AND p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p1)), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p2) p1)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 p1))]
Knowledge based reduction with 21 factoid took 1641 ms. Reduced automaton from 11 states, 52 edges and 3 AP (stutter sensitive) to 11 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 734 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-23 18:38:29] [INFO ] Invariant cache hit.
[2023-03-23 18:38:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:38:29] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 18:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:38:29] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 18:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:38:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:38:29] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 18:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:38:30] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-23 18:38:30] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:38:30] [INFO ] Added : 20 causal constraints over 4 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:38:30] [INFO ] Invariant cache hit.
[2023-03-23 18:38:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-23 18:38:30] [INFO ] Invariant cache hit.
[2023-03-23 18:38:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-23 18:38:30] [INFO ] Invariant cache hit.
[2023-03-23 18:38:30] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 27/29 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 55 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1255 ms. Reduced automaton from 11 states, 52 edges and 3 AP (stutter sensitive) to 11 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10182 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=565 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 27 cols
[2023-03-23 18:38:32] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-23 18:38:32] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 18:38:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 18:38:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-23 18:38:50] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:38:50] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-23 18:38:50] [INFO ] After 18236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 30 ms.
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 22/22 transitions.
Graph (trivial) has 6 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 52 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 22 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 22 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 20 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 19 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 18 transition count 12
Applied a total of 14 rules in 14 ms. Remains 18 /27 variables (removed 9) and now considering 12/22 (removed 10) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 18:38:50] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-23 18:38:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 18/27 places, 12/22 transitions.
Incomplete random walk after 10184 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1018 ) properties (out of 1) seen :0
Finished Best-First random walk after 2128 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1064 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p1)), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p2) p1)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 p1))]
Knowledge based reduction with 22 factoid took 1643 ms. Reduced automaton from 11 states, 52 edges and 3 AP (stutter sensitive) to 11 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 22 rows 27 cols
[2023-03-23 18:38:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 18:38:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:38:52] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 18:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:38:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 18:38:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:38:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 18:38:53] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 18:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:38:53] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-23 18:38:53] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:38:53] [INFO ] Added : 20 causal constraints over 4 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 34 reset in 94 ms.
Product exploration explored 100000 steps with 34 reset in 159 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Graph (trivial) has 6 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 53 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 24 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 24 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 23 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 23 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 23 transition count 19
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 22 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 22 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 11 rules in 7 ms. Remains 22 /27 variables (removed 5) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-23 18:38:54] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 18:38:54] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-23 18:38:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2023-03-23 18:38:54] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 18:38:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/27 places, 18/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 22/27 places, 18/22 transitions.
Built C files in :
/tmp/ltsmin9249149406862451064
[2023-03-23 18:38:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9249149406862451064
Running compilation step : cd /tmp/ltsmin9249149406862451064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 274 ms.
Running link step : cd /tmp/ltsmin9249149406862451064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9249149406862451064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4789488200338540773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:39:09] [INFO ] Invariant cache hit.
[2023-03-23 18:39:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-23 18:39:09] [INFO ] Invariant cache hit.
[2023-03-23 18:39:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-23 18:39:09] [INFO ] Invariant cache hit.
[2023-03-23 18:39:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-23 18:39:09] [INFO ] Invariant cache hit.
[2023-03-23 18:39:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 27/27 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin8229933404482230855
[2023-03-23 18:39:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8229933404482230855
Running compilation step : cd /tmp/ltsmin8229933404482230855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin8229933404482230855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8229933404482230855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5733509787528671514.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-01 finished in 46347 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((X(F(p1))&&G(p2)&&p0)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 18:39:10] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-23 18:39:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-23 18:39:10] [INFO ] Invariant cache hit.
[2023-03-23 18:39:10] [INFO ] Implicit Places using invariants in 32 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ s12 s7), p1:(LEQ 1 s15), p0:(AND (LEQ 1 s1) (LEQ s12 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-03 finished in 273 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(X((X(F(p0))||(p1&&X((F(p2)||G(p1))))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:39:10] [INFO ] Invariant cache hit.
[2023-03-23 18:39:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-23 18:39:10] [INFO ] Invariant cache hit.
[2023-03-23 18:39:10] [INFO ] Implicit Places using invariants in 28 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(GT s20 s11), p2:(LEQ 1 s0), p1:(GT 2 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Product exploration explored 100000 steps with 25000 reset in 113 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 (NOT p2) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10071 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1007 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1344629 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1344629 steps, saw 219900 distinct states, run finished after 3002 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 29 cols
[2023-03-23 18:39:14] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-23 18:39:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:39:14] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 18:39:14] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 18:39:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:39:14] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 18:39:14] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-04 finished in 4326 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(F((p0||(F(p1)&&X(G((p1||G(p0)))))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 18:39:14] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 18:39:14] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 18:39:14] [INFO ] Invariant cache hit.
[2023-03-23 18:39:14] [INFO ] Implicit Places using invariants in 35 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s11 s27), p1:(LEQ 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 72 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-06 finished in 411 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(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:39:15] [INFO ] Invariant cache hit.
[2023-03-23 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-23 18:39:15] [INFO ] Invariant cache hit.
[2023-03-23 18:39:15] [INFO ] Implicit Places using invariants in 32 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s26 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-07 finished in 162 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(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 3 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 12 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 22 transition count 15
Applied a total of 15 rules in 10 ms. Remains 22 /31 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-23 18:39:15] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-23 18:39:15] [INFO ] Invariant cache hit.
[2023-03-23 18:39:15] [INFO ] Implicit Places using invariants in 26 ms returned [1, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 15/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 14
Applied a total of 2 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 19 cols
[2023-03-23 18:39:15] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 18:39:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-23 18:39:15] [INFO ] Invariant cache hit.
[2023-03-23 18:39:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 18:39:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/31 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 19/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s12), p0:(GT 1 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-08 finished in 241 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(X(X((p0||G(F(p1)))))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 18:39:15] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-23 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 18:39:15] [INFO ] Invariant cache hit.
[2023-03-23 18:39:15] [INFO ] Implicit Places using invariants in 29 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 486 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s27), p1:(GT 3 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Product exploration explored 100000 steps with 25000 reset in 72 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 2839 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=946 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2023-03-23 18:39:16] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-23 18:39:17] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-23 18:39:17] [INFO ] Invariant cache hit.
[2023-03-23 18:39:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 18:39:17] [INFO ] Invariant cache hit.
[2023-03-23 18:39:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/29 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 27/29 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 55 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 1513 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=756 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 61 ms.
Product exploration explored 100000 steps with 25000 reset in 61 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 53 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 24 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 24 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 24 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 21 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 21 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 21 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 19 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 19 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 20 rules in 11 ms. Remains 19 /27 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 19 cols
[2023-03-23 18:39:18] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-23 18:39:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-23 18:39:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2023-03-23 18:39:18] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-23 18:39:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/27 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 19/27 places, 15/22 transitions.
Built C files in :
/tmp/ltsmin13527982281670089710
[2023-03-23 18:39:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13527982281670089710
Running compilation step : cd /tmp/ltsmin13527982281670089710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin13527982281670089710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13527982281670089710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased266935554355076943.hoa' '--buchi-type=spotba'
LTSmin run took 495 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-09 finished in 3796 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(X(G(p0))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2023-03-23 18:39:19] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 18:39:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 18:39:19] [INFO ] Invariant cache hit.
[2023-03-23 18:39:19] [INFO ] Implicit Places using invariants in 28 ms returned [1, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ s10 s17) (LEQ 2 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-10 finished in 152 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(F(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 18:39:19] [INFO ] Invariant cache hit.
[2023-03-23 18:39:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-23 18:39:19] [INFO ] Invariant cache hit.
[2023-03-23 18:39:19] [INFO ] Implicit Places using invariants in 24 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 72 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-11 finished in 329 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' '!((p0 U (p1&&F(p0))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 16 place count 22 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 21 transition count 13
Applied a total of 18 rules in 18 ms. Remains 21 /31 variables (removed 10) and now considering 13/22 (removed 9) transitions.
// Phase 1: matrix 13 rows 21 cols
[2023-03-23 18:39:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 18:39:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-23 18:39:19] [INFO ] Invariant cache hit.
[2023-03-23 18:39:19] [INFO ] Implicit Places using invariants in 27 ms returned [1, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 13/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 12
Applied a total of 2 rules in 2 ms. Remains 18 /19 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-23 18:39:19] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 18:39:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-23 18:39:19] [INFO ] Invariant cache hit.
[2023-03-23 18:39:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 18:39:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/31 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 164 ms. Remains : 16/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s13 s2), p1:(GT s0 s8)], 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][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-13 finished in 248 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))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 28 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 22 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 21 transition count 14
Applied a total of 18 rules in 20 ms. Remains 21 /31 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 21 cols
[2023-03-23 18:39:19] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-23 18:39:20] [INFO ] Invariant cache hit.
[2023-03-23 18:39:20] [INFO ] Implicit Places using invariants in 23 ms returned [1, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 14/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Applied a total of 4 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-23 18:39:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 18:39:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-23 18:39:20] [INFO ] Invariant cache hit.
[2023-03-23 18:39:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/31 places, 12/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 145 ms. Remains : 16/31 places, 12/22 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s8)], 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][true]]
Stuttering criterion allowed to conclude after 1089 steps with 22 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-14 finished in 186 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(F(p0)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 29 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 12 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 22 transition count 15
Applied a total of 15 rules in 4 ms. Remains 22 /31 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 22 cols
[2023-03-23 18:39:20] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-23 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-23 18:39:20] [INFO ] Invariant cache hit.
[2023-03-23 18:39:20] [INFO ] Implicit Places using invariants in 34 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 21/31 places, 15/22 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s1 s6) (GT 3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLCardinality-15 finished in 126 ms.
All properties solved by simple procedures.
Total runtime 58036 ms.

BK_STOP 1679596765797

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="GPPP-PT-C0100N0000001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPPP-PT-C0100N0000001000, 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 r165-tall-167838851000859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 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 ;