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.r137-smll-167819417000009.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 ltsminxred
Input is Dekker-PT-015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417000009
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME Dekker-PT-015-CTLCardinality-01
FORMULA_NAME Dekker-PT-015-CTLCardinality-02
FORMULA_NAME Dekker-PT-015-CTLCardinality-03
FORMULA_NAME Dekker-PT-015-CTLCardinality-04
FORMULA_NAME Dekker-PT-015-CTLCardinality-05
FORMULA_NAME Dekker-PT-015-CTLCardinality-06
FORMULA_NAME Dekker-PT-015-CTLCardinality-07
FORMULA_NAME Dekker-PT-015-CTLCardinality-08
FORMULA_NAME Dekker-PT-015-CTLCardinality-09
FORMULA_NAME Dekker-PT-015-CTLCardinality-10
FORMULA_NAME Dekker-PT-015-CTLCardinality-11
FORMULA_NAME Dekker-PT-015-CTLCardinality-12
FORMULA_NAME Dekker-PT-015-CTLCardinality-13
FORMULA_NAME Dekker-PT-015-CTLCardinality-14
FORMULA_NAME Dekker-PT-015-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678517468431

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 06:51:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:51:12] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-11 06:51:12] [INFO ] Transformed 75 places.
[2023-03-11 06:51:12] [INFO ] Transformed 255 transitions.
[2023-03-11 06:51:12] [INFO ] Found NUPN structural information;
[2023-03-11 06:51:12] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Dekker-PT-015-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 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 23 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 06:51:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-11 06:51:12] [INFO ] Computed 45 place invariants in 11 ms
[2023-03-11 06:51:12] [INFO ] Implicit Places using invariants in 308 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 359 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 74/75 places, 255/255 transitions.
Support contains 61 out of 74 places after structural reductions.
[2023-03-11 06:51:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 06:51:13] [INFO ] Flatten gal took : 121 ms
FORMULA Dekker-PT-015-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 06:51:13] [INFO ] Flatten gal took : 59 ms
[2023-03-11 06:51:13] [INFO ] Input system was already deterministic with 255 transitions.
Support contains 55 out of 74 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 45) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 06:51:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 74 cols
[2023-03-11 06:51:14] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-11 06:51:14] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-11 06:51:14] [INFO ] [Real]Absence check using 30 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 06:51:14] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2023-03-11 06:51:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:14] [INFO ] After 30ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 06:51:14] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 06:51:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-11 06:51:14] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-11 06:51:14] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 06:51:14] [INFO ] After 103ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 10 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 06:51:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 499 ms
[2023-03-11 06:51:15] [INFO ] After 731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 06:51:15] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 19 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 34 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :2
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
Running SMT prover for 4 properties.
[2023-03-11 06:51:16] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:16] [INFO ] Invariant cache hit.
[2023-03-11 06:51:16] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2023-03-11 06:51:16] [INFO ] [Real]Absence check using 30 positive and 14 generalized place invariants in 10 ms returned sat
[2023-03-11 06:51:16] [INFO ] After 67ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 06:51:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:16] [INFO ] After 12ms SMT Verify possible using 15 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-11 06:51:16] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 06:51:16] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-11 06:51:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-11 06:51:16] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-11 06:51:16] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 06:51:16] [INFO ] After 47ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 06:51:16] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-11 06:51:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-11 06:51:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-11 06:51:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-11 06:51:16] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-11 06:51:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
[2023-03-11 06:51:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 06:51:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-11 06:51:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 06:51:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 06:51:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 493 ms
[2023-03-11 06:51:17] [INFO ] After 600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-11 06:51:17] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 17 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 30 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:51:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:17] [INFO ] Invariant cache hit.
[2023-03-11 06:51:17] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:51:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-11 06:51:17] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 11 ms returned sat
[2023-03-11 06:51:17] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:17] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:17] [INFO ] After 29ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 601 ms
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 06:51:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 302 ms
[2023-03-11 06:51:18] [INFO ] After 958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 06:51:18] [INFO ] After 1166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 39 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 74/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 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 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1119456 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :{}
Probabilistic random walk after 1119456 steps, saw 98256 distinct states, run finished after 3008 ms. (steps per millisecond=372 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:51:22] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:22] [INFO ] Invariant cache hit.
[2023-03-11 06:51:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:51:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-11 06:51:22] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-11 06:51:22] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:22] [INFO ] After 19ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
[2023-03-11 06:51:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 413 ms
[2023-03-11 06:51:22] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 06:51:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 372 ms
[2023-03-11 06:51:23] [INFO ] After 829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 06:51:23] [INFO ] After 968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 21 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 74/74 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 21 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 06:51:23] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:23] [INFO ] Invariant cache hit.
[2023-03-11 06:51:23] [INFO ] Implicit Places using invariants in 217 ms returned [30, 36, 42, 48, 51, 54, 65, 68, 71]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 219 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/74 places, 255/255 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 260 ms. Remains : 65/74 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:51:23] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 65 cols
[2023-03-11 06:51:23] [INFO ] Computed 35 place invariants in 10 ms
[2023-03-11 06:51:23] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-11 06:51:23] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-11 06:51:24] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:51:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-11 06:51:24] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-11 06:51:24] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:51:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:24] [INFO ] After 15ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:51:24] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-11 06:51:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-11 06:51:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
[2023-03-11 06:51:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 06:51:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 06:51:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-11 06:51:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 259 ms
[2023-03-11 06:51:24] [INFO ] After 284ms 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-11 06:51:24] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 255/255 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 65/65 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1694416 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :{}
Probabilistic random walk after 1694416 steps, saw 114767 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:51:27] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:27] [INFO ] Invariant cache hit.
[2023-03-11 06:51:27] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-11 06:51:27] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-11 06:51:27] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:51:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-11 06:51:27] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-11 06:51:27] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:51:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:27] [INFO ] After 9ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-11 06:51:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 234 ms
[2023-03-11 06:51:27] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 06:51:27] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 65 /65 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 65/65 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 65 /65 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-11 06:51:27] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:28] [INFO ] Invariant cache hit.
[2023-03-11 06:51:28] [INFO ] Implicit Places using invariants in 168 ms returned [32, 37, 42, 51, 56]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 172 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/65 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 2 iterations and 198 ms. Remains : 60/65 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 1844320 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :{}
Probabilistic random walk after 1844320 steps, saw 131052 distinct states, run finished after 3001 ms. (steps per millisecond=614 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:51:31] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2023-03-11 06:51:31] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-11 06:51:31] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-11 06:51:31] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:51:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-11 06:51:31] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:51:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:31] [INFO ] After 9ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-11 06:51:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 211 ms
[2023-03-11 06:51:31] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 06:51:31] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 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 6 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 7 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-11 06:51:31] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:31] [INFO ] Invariant cache hit.
[2023-03-11 06:51:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 06:51:31] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:31] [INFO ] Invariant cache hit.
[2023-03-11 06:51:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 06:51:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-11 06:51:31] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 06:51:31] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-11 06:51:31] [INFO ] Invariant cache hit.
[2023-03-11 06:51:32] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 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.1 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 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 10 transition count 9
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 48 place count 8 transition count 8
Applied a total of 48 rules in 9 ms. Remains 8 /60 variables (removed 52) and now considering 8/255 (removed 247) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 06:51:32] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 06:51:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 06:51:32] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 06:51:32] [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 3 ms.
[2023-03-11 06:51:32] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 26 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 30 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 22 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 25 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 21 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 21 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 17 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 18 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 17 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 17 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:51:32] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:51:33] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:51:33] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 74/74 places, 255/255 transitions.
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 12 ms
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:51:33] [INFO ] Input system was already deterministic with 255 transitions.
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:51:33] [INFO ] Flatten gal took : 14 ms
[2023-03-11 06:51:33] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-11 06:51:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 255 transitions and 1814 arcs took 6 ms.
Total runtime 21251 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/780/ctl_0_ --ctl=/tmp/780/ctl_1_ --ctl=/tmp/780/ctl_2_ --ctl=/tmp/780/ctl_3_ --ctl=/tmp/780/ctl_4_ --ctl=/tmp/780/ctl_5_ --ctl=/tmp/780/ctl_6_ --ctl=/tmp/780/ctl_7_ --ctl=/tmp/780/ctl_8_ --ctl=/tmp/780/ctl_9_ --ctl=/tmp/780/ctl_10_ --mu-par --mu-opt
FORMULA Dekker-PT-015-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-015-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678517913221

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name Dekker-PT-015-CTLCardinality-00
ctl formula formula --ctl=/tmp/780/ctl_0_
ctl formula name Dekker-PT-015-CTLCardinality-02
ctl formula formula --ctl=/tmp/780/ctl_1_
ctl formula name Dekker-PT-015-CTLCardinality-03
ctl formula formula --ctl=/tmp/780/ctl_2_
ctl formula name Dekker-PT-015-CTLCardinality-04
ctl formula formula --ctl=/tmp/780/ctl_3_
ctl formula name Dekker-PT-015-CTLCardinality-05
ctl formula formula --ctl=/tmp/780/ctl_4_
ctl formula name Dekker-PT-015-CTLCardinality-06
ctl formula formula --ctl=/tmp/780/ctl_5_
ctl formula name Dekker-PT-015-CTLCardinality-08
ctl formula formula --ctl=/tmp/780/ctl_6_
ctl formula name Dekker-PT-015-CTLCardinality-10
ctl formula formula --ctl=/tmp/780/ctl_7_
ctl formula name Dekker-PT-015-CTLCardinality-11
ctl formula formula --ctl=/tmp/780/ctl_8_
ctl formula name Dekker-PT-015-CTLCardinality-14
ctl formula formula --ctl=/tmp/780/ctl_9_
ctl formula name Dekker-PT-015-CTLCardinality-15
ctl formula formula --ctl=/tmp/780/ctl_10_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 74 places, 255 transitions and 1814 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 255->240 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 74; there are 240 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 5464612 group checks and 0 next state calls
pnml2lts-sym: reachability took 113.510 real 453.350 user 0.100 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.090 user 0.000 sys
pnml2lts-sym: state space has 278528 states, 393139 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/780/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/780/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/780/ctl_7_ holds for the initial state
pnml2lts-sym: group_next: 3100 nodes total
pnml2lts-sym: group_explored: 3066 nodes, 738585 short vectors total
pnml2lts-sym: max token count: 1
free(): invalid pointer

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="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Dekker-PT-015, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819417000009"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;