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.r135-smll-167819413300011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Dekker-PT-015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413300011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 141K 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 Dekker-PT-015-LTLCardinality-00
FORMULA_NAME Dekker-PT-015-LTLCardinality-01
FORMULA_NAME Dekker-PT-015-LTLCardinality-02
FORMULA_NAME Dekker-PT-015-LTLCardinality-03
FORMULA_NAME Dekker-PT-015-LTLCardinality-04
FORMULA_NAME Dekker-PT-015-LTLCardinality-05
FORMULA_NAME Dekker-PT-015-LTLCardinality-06
FORMULA_NAME Dekker-PT-015-LTLCardinality-07
FORMULA_NAME Dekker-PT-015-LTLCardinality-08
FORMULA_NAME Dekker-PT-015-LTLCardinality-09
FORMULA_NAME Dekker-PT-015-LTLCardinality-10
FORMULA_NAME Dekker-PT-015-LTLCardinality-11
FORMULA_NAME Dekker-PT-015-LTLCardinality-12
FORMULA_NAME Dekker-PT-015-LTLCardinality-13
FORMULA_NAME Dekker-PT-015-LTLCardinality-14
FORMULA_NAME Dekker-PT-015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678265370671

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 08:49:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 08:49:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:49:34] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-08 08:49:34] [INFO ] Transformed 75 places.
[2023-03-08 08:49:34] [INFO ] Transformed 255 transitions.
[2023-03-08 08:49:34] [INFO ] Found NUPN structural information;
[2023-03-08 08:49:34] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Dekker-PT-015-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 35 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:34] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-08 08:49:34] [INFO ] Computed 45 place invariants in 9 ms
[2023-03-08 08:49:35] [INFO ] Implicit Places using invariants in 456 ms returned [33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 69, 72]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 528 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/75 places, 255/255 transitions.
Applied a total of 0 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 575 ms. Remains : 62/75 places, 255/255 transitions.
Support contains 24 out of 62 places after structural reductions.
[2023-03-08 08:49:35] [INFO ] Flatten gal took : 108 ms
[2023-03-08 08:49:35] [INFO ] Flatten gal took : 69 ms
[2023-03-08 08:49:36] [INFO ] Input system was already deterministic with 255 transitions.
Support contains 23 out of 62 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 08:49:36] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2023-03-08 08:49:36] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-08 08:49:36] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 08:49:36] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 08:49:37] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-08 08:49:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:49:37] [INFO ] After 20ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-08 08:49:37] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 08:49:37] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-08 08:49:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-08 08:49:37] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:49:37] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 08:49:37] [INFO ] After 36ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 08:49:37] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 08:49:37] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 35 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 62/62 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 778800 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 778800 steps, saw 81249 distinct states, run finished after 3002 ms. (steps per millisecond=259 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-08 08:49:40] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:40] [INFO ] Invariant cache hit.
[2023-03-08 08:49:41] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-08 08:49:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 08:49:41] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:49:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-08 08:49:41] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:49:41] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:49:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:49:41] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:49:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2023-03-08 08:49:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2023-03-08 08:49:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 08:49:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-08 08:49:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 178 ms
[2023-03-08 08:49:41] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 08:49:41] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 17 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 62/62 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1197472 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :{}
Probabilistic random walk after 1197472 steps, saw 98281 distinct states, run finished after 3002 ms. (steps per millisecond=398 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:49:44] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:44] [INFO ] Invariant cache hit.
[2023-03-08 08:49:44] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 08:49:44] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:49:44] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:49:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-08 08:49:44] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 08:49:44] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:49:44] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:49:44] [INFO ] After 21ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:49:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-08 08:49:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-08 08:49:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-08 08:49:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-08 08:49:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 164 ms
[2023-03-08 08:49:45] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 08:49:45] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 34 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 62/62 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 22 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:45] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:45] [INFO ] Invariant cache hit.
[2023-03-08 08:49:45] [INFO ] Implicit Places using invariants in 183 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 27 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 236 ms. Remains : 60/62 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 790800 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 790800 steps, saw 81584 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:49:48] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2023-03-08 08:49:48] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-08 08:49:48] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-08 08:49:48] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:49:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-08 08:49:48] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:49:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:49:48] [INFO ] After 19ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-08 08:49:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 296 ms
[2023-03-08 08:49:49] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 08:49:49] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 60/60 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:49] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:49] [INFO ] Invariant cache hit.
[2023-03-08 08:49:49] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 08:49:49] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:49] [INFO ] Invariant cache hit.
[2023-03-08 08:49:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:49:49] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-08 08:49:49] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-08 08:49:49] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:49] [INFO ] Invariant cache hit.
[2023-03-08 08:49:50] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 846 ms. Remains : 60/60 places, 255/255 transitions.
Graph (complete) has 90 edges and 60 vertex of which 12 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Discarding 48 places :
Also discarding 204 output transitions
Drop transitions removed 204 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 12 transition count 12
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 1 with 3 rules applied. Total rules applied 43 place count 10 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 10 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 10 transition count 8
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 6 transition count 6
Applied a total of 52 rules in 20 ms. Remains 6 /60 variables (removed 54) and now considering 6/255 (removed 249) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-08 08:49:50] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 08:49:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 08:49:50] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-08 08:49:50] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 08:49:50] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
FORMULA Dekker-PT-015-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G((F(p0) U p1))&&X((X((!p0 U (!p3||G(!p0))))&&p2))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:50] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2023-03-08 08:49:50] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-08 08:49:50] [INFO ] Implicit Places using invariants in 227 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 229 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 239 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 644 ms :[(OR (NOT p2) (NOT p1) (AND p0 p3)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND p0 p3)), true, (AND p0 p3)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s52 1), p0:(OR (EQ s55 0) (EQ s47 1)), p2:(AND (NEQ s55 0) (NEQ s47 1)), p3:(OR (EQ s5 0) (EQ s37 1))], 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 5 reset in 6 ms.
FORMULA Dekker-PT-015-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLCardinality-00 finished in 1011 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 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:51] [INFO ] Invariant cache hit.
[2023-03-08 08:49:51] [INFO ] Implicit Places using invariants in 190 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 193 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-04 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:(OR (EQ s3 0) (EQ s14 1))], 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 16 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-015-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLCardinality-04 finished in 368 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 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 21 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:51] [INFO ] Invariant cache hit.
[2023-03-08 08:49:52] [INFO ] Implicit Places using invariants in 176 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 180 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-05 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 (EQ s2 0) (EQ s30 1))], 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 7873 reset in 668 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-05 finished in 1023 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(G(p0)))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:52] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:52] [INFO ] Invariant cache hit.
[2023-03-08 08:49:53] [INFO ] Implicit Places using invariants in 183 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-06 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s49 0) (NEQ s4 1))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLCardinality-06 finished in 428 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(G(p0)))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:53] [INFO ] Invariant cache hit.
[2023-03-08 08:49:53] [INFO ] Implicit Places using invariants in 175 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s53 0) (EQ s1 1) (EQ s5 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 610 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-09 finished in 913 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 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:49:54] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:49:54] [INFO ] Invariant cache hit.
[2023-03-08 08:49:54] [INFO ] Implicit Places using invariants in 148 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 22 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-11 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:(OR (EQ s49 0) (EQ s6 1))], 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]]
Product exploration explored 100000 steps with 0 reset in 670 ms.
Product exploration explored 100000 steps with 0 reset in 594 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 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 71 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1444176 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :{}
Probabilistic random walk after 1444176 steps, saw 104037 distinct states, run finished after 3001 ms. (steps per millisecond=481 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:49:59] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2023-03-08 08:49:59] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-08 08:49:59] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 08:49:59] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:49:59] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-08 08:49:59] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:49:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:49:59] [INFO ] After 11ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 5 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-08 08:49:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 468 ms
[2023-03-08 08:49:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 468 ms
[2023-03-08 08:49:59] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 08:49:59] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 11 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 60/60 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1550272 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1550272 steps, saw 114643 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:50:02] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:02] [INFO ] Invariant cache hit.
[2023-03-08 08:50:03] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 08:50:03] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:50:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 08:50:03] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:50:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:03] [INFO ] After 13ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-08 08:50:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 372 ms
[2023-03-08 08:50:03] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 08:50:03] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 60/60 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:50:03] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:03] [INFO ] Invariant cache hit.
[2023-03-08 08:50:03] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 08:50:03] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:03] [INFO ] Invariant cache hit.
[2023-03-08 08:50:03] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:03] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-08 08:50:03] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 08:50:03] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:03] [INFO ] Invariant cache hit.
[2023-03-08 08:50:04] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 754 ms. Remains : 60/60 places, 255/255 transitions.
Graph (complete) has 90 edges and 60 vertex of which 8 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.0 ms
Discarding 52 places :
Also discarding 221 output transitions
Drop transitions removed 221 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 8 transition count 8
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 1 with 3 rules applied. Total rules applied 30 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 4 transition count 4
Applied a total of 35 rules in 7 ms. Remains 4 /60 variables (removed 56) and now considering 4/255 (removed 251) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-08 08:50:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:50:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 08:50:04] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 08:50:04] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-08 08:50:04] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 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 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:50:04] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2023-03-08 08:50:04] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-08 08:50:04] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-08 08:50:04] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:04] [INFO ] Invariant cache hit.
[2023-03-08 08:50:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:05] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-08 08:50:05] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 08:50:05] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:05] [INFO ] Invariant cache hit.
[2023-03-08 08:50:05] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 756 ms. Remains : 60/60 places, 255/255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 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 68 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1702560 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :{}
Probabilistic random walk after 1702560 steps, saw 118801 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:50:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:08] [INFO ] Invariant cache hit.
[2023-03-08 08:50:09] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-08 08:50:09] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:50:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-08 08:50:09] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:50:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:09] [INFO ] After 9ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-08 08:50:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 340 ms
[2023-03-08 08:50:09] [INFO ] After 357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 08:50:09] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 60/60 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1468448 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1468448 steps, saw 112368 distinct states, run finished after 3003 ms. (steps per millisecond=488 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:50:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:12] [INFO ] Invariant cache hit.
[2023-03-08 08:50:12] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-08 08:50:12] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:50:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-08 08:50:12] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:50:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:12] [INFO ] After 7ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:50:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-08 08:50:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-08 08:50:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 6 ms to minimize.
[2023-03-08 08:50:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-08 08:50:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-08 08:50:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-08 08:50:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 08:50:13] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-08 08:50:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-08 08:50:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 370 ms
[2023-03-08 08:50:13] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 08:50:13] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 60/60 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:50:13] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 08:50:13] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:13] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-08 08:50:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 08:50:13] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:13] [INFO ] Invariant cache hit.
[2023-03-08 08:50:13] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 658 ms. Remains : 60/60 places, 255/255 transitions.
Graph (complete) has 90 edges and 60 vertex of which 8 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.0 ms
Discarding 52 places :
Also discarding 221 output transitions
Drop transitions removed 221 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 8 transition count 8
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 1 with 3 rules applied. Total rules applied 30 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 4 transition count 4
Applied a total of 35 rules in 8 ms. Remains 4 /60 variables (removed 56) and now considering 4/255 (removed 251) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-08 08:50:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:50:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 08:50:13] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 08:50:13] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 08:50:13] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 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 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:50:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2023-03-08 08:50:15] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-08 08:50:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 08:50:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:15] [INFO ] Invariant cache hit.
[2023-03-08 08:50:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 08:50:15] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-08 08:50:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:50:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:15] [INFO ] Invariant cache hit.
[2023-03-08 08:50:15] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 60/60 places, 255/255 transitions.
Treatment of property Dekker-PT-015-LTLCardinality-11 finished in 21667 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(X(F(p0)))))'
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:50:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2023-03-08 08:50:15] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-08 08:50:16] [INFO ] Implicit Places using invariants in 147 ms returned [30, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}]], initial=1, aps=[p0:(OR (EQ s50 0) (EQ s41 1)), p1:(OR (EQ s38 0) (EQ s44 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 33567 reset in 446 ms.
Stack based approach found an accepted trace after 95 steps with 46 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-12 finished in 771 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 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 08:50:16] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 08:50:16] [INFO ] Invariant cache hit.
[2023-03-08 08:50:16] [INFO ] Implicit Places using invariants in 119 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 61/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s27 1) (EQ s30 0) (EQ s29 1))], 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]]
Product exploration explored 100000 steps with 21073 reset in 596 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Dekker-PT-015-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLCardinality-14 finished in 789 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))'
[2023-03-08 08:50:17] [INFO ] Flatten gal took : 28 ms
[2023-03-08 08:50:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 08:50:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 255 transitions and 1622 arcs took 5 ms.
Total runtime 43756 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-015
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA Dekker-PT-015-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678265419070

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 5 (type SKEL/FNDP) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SKEL/EQUN) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SKEL/SRCH) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SKEL/SRCH) for Dekker-PT-015-LTLCardinality-11
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 5 (type FNDP) for Dekker-PT-015-LTLCardinality-11 (obsolete)
lola: CANCELED task # 6 (type EQUN) for Dekker-PT-015-LTLCardinality-11 (obsolete)
lola: CANCELED task # 8 (type SRCH) for Dekker-PT-015-LTLCardinality-11 (obsolete)
lola: FINISHED task # 8 (type SKEL/SRCH) for Dekker-PT-015-LTLCardinality-11
lola: result : unknown
lola: markings : 16
lola: fired transitions : 58
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 5 (type SKEL/FNDP) for Dekker-PT-015-LTLCardinality-11
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 6 (type SKEL/EQUN) for Dekker-PT-015-LTLCardinality-11
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 12 (type EXCL) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 13 (type SRCH) for 0 Dekker-PT-015-LTLCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 12 (type EXCL) for Dekker-PT-015-LTLCardinality-11
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 10 (type FNDP) for Dekker-PT-015-LTLCardinality-11 (obsolete)
lola: CANCELED task # 11 (type EQUN) for Dekker-PT-015-LTLCardinality-11 (obsolete)
lola: CANCELED task # 13 (type SRCH) for Dekker-PT-015-LTLCardinality-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-015-LTLCardinality-11: AG false state space


Time elapsed: 1 secs. Pages in use: 2

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="Dekker-PT-015"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Dekker-PT-015, 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 r135-smll-167819413300011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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