Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690600611.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690600611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K Feb 25 21:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 21:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678366291933

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=CANConstruction-PT-005
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 12:51:34] [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-09 12:51:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:51:34] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-09 12:51:34] [INFO ] Transformed 112 places.
[2023-03-09 12:51:34] [INFO ] Transformed 140 transitions.
[2023-03-09 12:51:34] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 101 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 3 formulas.
FORMULA CANConstruction-PT-005-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 104 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 104 transition count 124
Applied a total of 16 rules in 17 ms. Remains 104 /112 variables (removed 8) and now considering 124/140 (removed 16) transitions.
// Phase 1: matrix 124 rows 104 cols
[2023-03-09 12:51:34] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-09 12:51:34] [INFO ] Implicit Places using invariants in 229 ms returned [12, 26, 54, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 266 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/112 places, 124/140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 123
Applied a total of 2 rules in 5 ms. Remains 99 /100 variables (removed 1) and now considering 123/124 (removed 1) transitions.
// Phase 1: matrix 123 rows 99 cols
[2023-03-09 12:51:34] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-09 12:51:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 12:51:34] [INFO ] Invariant cache hit.
[2023-03-09 12:51:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-09 12:51:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/112 places, 123/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 460 ms. Remains : 99/112 places, 123/140 transitions.
Support contains 35 out of 99 places after structural reductions.
[2023-03-09 12:51:34] [INFO ] Flatten gal took : 40 ms
[2023-03-09 12:51:34] [INFO ] Flatten gal took : 11 ms
[2023-03-09 12:51:35] [INFO ] Input system was already deterministic with 123 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 28) seen :13
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-09 12:51:35] [INFO ] Invariant cache hit.
[2023-03-09 12:51:35] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 12:51:35] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 12:51:35] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:10
[2023-03-09 12:51:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-09 12:51:35] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 12:51:35] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :2
[2023-03-09 12:51:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-09 12:51:35] [INFO ] After 18ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :14 sat :1
[2023-03-09 12:51:35] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 12:51:35] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :1
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 90
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 66 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 64 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 70 place count 64 transition count 84
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 60 transition count 84
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 85 place count 53 transition count 70
Iterating global reduction 3 with 7 rules applied. Total rules applied 92 place count 53 transition count 70
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 97 place count 53 transition count 65
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 102 place count 48 transition count 65
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 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 106 place count 46 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 116 place count 41 transition count 73
Applied a total of 116 rules in 28 ms. Remains 41 /99 variables (removed 58) and now considering 73/123 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 41/99 places, 73/123 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 1778 states, properties seen :0
Probabilistic random walk after 10435 steps, saw 1778 distinct states, run finished after 22 ms. (steps per millisecond=474 ) properties seen :0
Explored full state space saw : 1778 states, properties seen :0
Exhaustive walk after 10435 steps, saw 1778 distinct states, run finished after 11 ms. (steps per millisecond=948 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 24 stable transitions
FORMULA CANConstruction-PT-005-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 99 transition count 89
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 65 transition count 89
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 68 place count 65 transition count 85
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 61 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 54 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 54 transition count 71
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 54 transition count 66
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 100 place count 49 transition count 66
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 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 47 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 114 place count 42 transition count 74
Applied a total of 114 rules in 37 ms. Remains 42 /99 variables (removed 57) and now considering 74/123 (removed 49) transitions.
// Phase 1: matrix 74 rows 42 cols
[2023-03-09 12:51:36] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 12:51:36] [INFO ] Implicit Places using invariants in 134 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/99 places, 74/123 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Applied a total of 4 rules in 5 ms. Remains 39 /41 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 39 cols
[2023-03-09 12:51:36] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 12:51:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-09 12:51:36] [INFO ] Invariant cache hit.
[2023-03-09 12:51:36] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-09 12:51:36] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/99 places, 72/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 443 ms. Remains : 39/99 places, 72/123 transitions.
Stuttering acceptance computed with spot in 549 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-00 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:(LEQ s13 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4885 reset in 354 ms.
Product exploration explored 100000 steps with 4935 reset in 236 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 112 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-09 12:51:38] [INFO ] Invariant cache hit.
[2023-03-09 12:51:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 12:51:38] [INFO ] Invariant cache hit.
[2023-03-09 12:51:38] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-09 12:51:38] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-09 12:51:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 12:51:38] [INFO ] Invariant cache hit.
[2023-03-09 12:51:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 39/39 places, 72/72 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 30 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4862 reset in 168 ms.
Product exploration explored 100000 steps with 4893 reset in 177 ms.
Built C files in :
/tmp/ltsmin9736904570278168299
[2023-03-09 12:51:39] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2023-03-09 12:51:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:51:39] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2023-03-09 12:51:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:51:39] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2023-03-09 12:51:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:51:39] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9736904570278168299
Running compilation step : cd /tmp/ltsmin9736904570278168299;'/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 322 ms.
Running link step : cd /tmp/ltsmin9736904570278168299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin9736904570278168299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased884098619850539571.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLCardinality-00 finished in 4359 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 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 99 transition count 89
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 65 transition count 89
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 68 place count 65 transition count 85
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 61 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 54 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 54 transition count 71
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 54 transition count 66
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 100 place count 49 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 47 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 114 place count 42 transition count 74
Applied a total of 114 rules in 29 ms. Remains 42 /99 variables (removed 57) and now considering 74/123 (removed 49) transitions.
// Phase 1: matrix 74 rows 42 cols
[2023-03-09 12:51:40] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-09 12:51:40] [INFO ] Implicit Places using invariants in 67 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/99 places, 74/123 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Applied a total of 4 rules in 6 ms. Remains 39 /41 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 39 cols
[2023-03-09 12:51:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 12:51:40] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 12:51:40] [INFO ] Invariant cache hit.
[2023-03-09 12:51:40] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-09 12:51:40] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/99 places, 72/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 239 ms. Remains : 39/99 places, 72/123 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-02 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:(GT 1 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]]
Product exploration explored 100000 steps with 4909 reset in 147 ms.
Product exploration explored 100000 steps with 4916 reset in 155 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Detected a total of 8/39 stabilizing places and 12/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 90 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 39 /39 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-09 12:51:42] [INFO ] Invariant cache hit.
[2023-03-09 12:51:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 12:51:42] [INFO ] Invariant cache hit.
[2023-03-09 12:51:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-09 12:51:42] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-09 12:51:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:51:42] [INFO ] Invariant cache hit.
[2023-03-09 12:51:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 39/39 places, 72/72 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Detected a total of 8/39 stabilizing places and 12/72 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4943 reset in 154 ms.
Product exploration explored 100000 steps with 4865 reset in 152 ms.
Built C files in :
/tmp/ltsmin3500369135699025501
[2023-03-09 12:51:43] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2023-03-09 12:51:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:51:43] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2023-03-09 12:51:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:51:43] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2023-03-09 12:51:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:51:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3500369135699025501
Running compilation step : cd /tmp/ltsmin3500369135699025501;'/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 230 ms.
Running link step : cd /tmp/ltsmin3500369135699025501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3500369135699025501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13316990259627622051.hoa' '--buchi-type=spotba'
LTSmin run took 103 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLCardinality-02 finished in 3480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 99 transition count 89
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 65 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 64 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 61 transition count 85
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 83 place count 54 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 90 place count 54 transition count 71
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 95 place count 54 transition count 66
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 100 place count 49 transition count 66
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 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 47 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 114 place count 42 transition count 74
Applied a total of 114 rules in 15 ms. Remains 42 /99 variables (removed 57) and now considering 74/123 (removed 49) transitions.
// Phase 1: matrix 74 rows 42 cols
[2023-03-09 12:51:44] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants in 43 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/99 places, 74/123 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Applied a total of 4 rules in 5 ms. Remains 39 /41 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 39 cols
[2023-03-09 12:51:44] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 12:51:44] [INFO ] Invariant cache hit.
[2023-03-09 12:51:44] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/99 places, 72/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 39/99 places, 72/123 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-04 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}]], initial=1, aps=[p0:(GT 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-04 finished in 243 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 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 90 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 90 transition count 108
Applied a total of 18 rules in 8 ms. Remains 90 /99 variables (removed 9) and now considering 108/123 (removed 15) transitions.
// Phase 1: matrix 108 rows 90 cols
[2023-03-09 12:51:44] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants in 60 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/99 places, 108/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 4 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2023-03-09 12:51:44] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 12:51:44] [INFO ] Invariant cache hit.
[2023-03-09 12:51:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/99 places, 107/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 333 ms. Remains : 88/99 places, 107/123 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-05 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 s71 s59)], 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 CANConstruction-PT-005-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-05 finished in 444 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 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 90 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 90 transition count 107
Applied a total of 18 rules in 4 ms. Remains 90 /99 variables (removed 9) and now considering 107/123 (removed 16) transitions.
// Phase 1: matrix 107 rows 90 cols
[2023-03-09 12:51:44] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants in 81 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/99 places, 107/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 106
Applied a total of 2 rules in 6 ms. Remains 88 /89 variables (removed 1) and now considering 106/107 (removed 1) transitions.
// Phase 1: matrix 106 rows 88 cols
[2023-03-09 12:51:44] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 12:51:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 12:51:44] [INFO ] Invariant cache hit.
[2023-03-09 12:51:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-09 12:51:45] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/99 places, 106/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 347 ms. Remains : 88/99 places, 106/123 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-09 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 s15 s12)], 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 13106 reset in 231 ms.
Product exploration explored 100000 steps with 13112 reset in 240 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-09 12:51:46] [INFO ] Invariant cache hit.
[2023-03-09 12:51:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-09 12:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:51:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-09 12:51:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:51:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 52 ms returned sat
[2023-03-09 12:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:51:50] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2023-03-09 12:51:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-09 12:51:50] [INFO ] [Nat]Added 45 Read/Feed constraints in 33 ms returned sat
[2023-03-09 12:51:50] [INFO ] Computed and/alt/rep : 101/213/101 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-09 12:51:50] [INFO ] Added : 41 causal constraints over 9 iterations in 154 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 106/106 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 88 transition count 71
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 53 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 52 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 72 place count 52 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 82 place count 47 transition count 65
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 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 43 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 39 transition count 69
Applied a total of 98 rules in 8 ms. Remains 39 /88 variables (removed 49) and now considering 69/106 (removed 37) transitions.
// Phase 1: matrix 69 rows 39 cols
[2023-03-09 12:51:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 12:51:52] [INFO ] Implicit Places using invariants in 1945 ms returned []
[2023-03-09 12:51:52] [INFO ] Invariant cache hit.
[2023-03-09 12:51:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 12:51:53] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2023-03-09 12:51:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 12:51:53] [INFO ] Invariant cache hit.
[2023-03-09 12:51:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/88 places, 69/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3530 ms. Remains : 39/88 places, 69/106 transitions.
Computed a total of 6 stabilizing places and 10 stable transitions
Computed a total of 6 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-09 12:51:54] [INFO ] Invariant cache hit.
[2023-03-09 12:51:54] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-09 12:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:51:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 12:51:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:51:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-09 12:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:51:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-09 12:51:54] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 12:51:54] [INFO ] [Nat]Added 61 Read/Feed constraints in 6 ms returned sat
[2023-03-09 12:51:54] [INFO ] Computed and/alt/rep : 47/257/47 causal constraints (skipped 17 transitions) in 17 ms.
[2023-03-09 12:51:54] [INFO ] Added : 11 causal constraints over 3 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19268 reset in 115 ms.
Stack based approach found an accepted trace after 11 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-09 finished in 9899 ms.
All properties solved by simple procedures.
Total runtime 20643 ms.

BK_STOP 1678366315009

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r037-tajo-167813690600611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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