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.r074-smll-167814399900121.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 marciexred
Input is CircadianClock-PT-001000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 137K Feb 26 10:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-001000-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-001000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678299810892

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-001000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 18:23:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 18:23:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:23:33] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-08 18:23:33] [INFO ] Transformed 14 places.
[2023-03-08 18:23:33] [INFO ] Transformed 16 transitions.
[2023-03-08 18:23:33] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 13 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 18:23:33] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 18:23:33] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-08 18:23:33] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-08 18:23:33] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:33] [INFO ] Invariant cache hit.
[2023-03-08 18:23:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:23:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-08 18:23:33] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:33] [INFO ] Invariant cache hit.
[2023-03-08 18:23:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 18:23:34] [INFO ] Flatten gal took : 23 ms
[2023-03-08 18:23:34] [INFO ] Flatten gal took : 9 ms
[2023-03-08 18:23:34] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 85) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 44) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 40) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2023-03-08 18:23:35] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:35] [INFO ] Invariant cache hit.
[2023-03-08 18:23:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:35] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:29
[2023-03-08 18:23:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:35] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :16 sat :22
[2023-03-08 18:23:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:23:35] [INFO ] After 64ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :16 sat :22
[2023-03-08 18:23:35] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :16 sat :22
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 18:23:35] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :22
Fused 38 Parikh solutions to 22 different solutions.
Parikh walk visited 1 properties in 2371 ms.
Support contains 13 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2002 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 152972 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{2=1, 3=1, 5=1, 12=1, 15=1, 16=1, 17=1, 19=1, 20=1}
Probabilistic random walk after 152972 steps, saw 110699 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :9
Running SMT prover for 12 properties.
[2023-03-08 18:23:41] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:41] [INFO ] Invariant cache hit.
[2023-03-08 18:23:41] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:41] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 18:23:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:41] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 18:23:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:23:41] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-08 18:23:41] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-08 18:23:41] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 1390 ms.
Support contains 10 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 167310 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167310 steps, saw 119822 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-08 18:23:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:46] [INFO ] Invariant cache hit.
[2023-03-08 18:23:46] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:46] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 18:23:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 18:23:46] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 18:23:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:23:46] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-08 18:23:46] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 18:23:46] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 1667 ms.
Support contains 10 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 18:23:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:48] [INFO ] Invariant cache hit.
[2023-03-08 18:23:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 18:23:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:48] [INFO ] Invariant cache hit.
[2023-03-08 18:23:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:23:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-08 18:23:48] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 18:23:48] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:23:48] [INFO ] Invariant cache hit.
[2023-03-08 18:23:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 14/14 places, 16/16 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 14
Applied a total of 2 rules in 4 ms. Remains 14 /14 variables (removed 0) and now considering 14/16 (removed 2) transitions.
Running SMT prover for 12 properties.
[2023-03-08 18:23:48] [INFO ] Invariant cache hit.
[2023-03-08 18:23:48] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:48] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 18:23:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 18:23:48] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 18:23:48] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 18:23:49] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
FORMULA CircadianClock-PT-001000-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 5 ms
[2023-03-08 18:23:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CircadianClock-PT-001000-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-001000-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 18 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 7 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 5 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 8 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 6 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 12 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:23:49] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 7008 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2336 )
FORMULA CircadianClock-PT-001000-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:23:49] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2023-03-08 18:23:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 16 transitions and 58 arcs took 1 ms.
Total runtime 16000 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 14 NrTr: 16 NrArc: 58)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.748sec


RS generation: 0m 3.631sec


-> reachability set: #nodes 5016 (5.0e+03) #states 4,020,040,040,020,004 (15)



starting MCC model checker
--------------------------

checking: EX [AF [EG [EF [p11<=383]]]]
normalized: EX [~ [EG [~ [EG [E [true U p11<=383]]]]]]

abstracting: (p11<=383)
states: 1,542,153,222,145,536 (15)

EG iterations: 0
.
EG iterations: 1
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.645sec

checking: AG [AF [[~ [263<=p0] & ~ [566<=p1]]]]
normalized: ~ [E [true U EG [~ [[~ [566<=p1] & ~ [263<=p0]]]]]]

abstracting: (263<=p0)
states: 2,963,825,723,810,952 (15)
abstracting: (566<=p1)
states: 1,746,970,446,961,740 (15)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.155sec

checking: EF [EX [~ [p6<=p9]]]
normalized: E [true U EX [~ [p6<=p9]]]

abstracting: (p6<=p9)
states: 2,012,028,032,018,004 (15)
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.787sec

checking: AG [[EG [[~ [25<=p8] | ~ [827<=p12]]] | EF [p2<=p9]]]
normalized: ~ [E [true U ~ [[E [true U p2<=p9] | EG [[~ [827<=p12] | ~ [25<=p8]]]]]]]

abstracting: (25<=p8)
states: 3,919,639,439,619,904 (15)
abstracting: (827<=p12)
states: 698,788,178,784,696 (14)
.
EG iterations: 1
abstracting: (p2<=p9)
states: 4,018,032,028,012,002 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.802sec

checking: EF [[EX [EX [[88<=p11 & p2<=p9]]] & EG [AX [871<=p7]]]]
normalized: E [true U [EG [~ [EX [~ [871<=p7]]]] & EX [EX [[88<=p11 & p2<=p9]]]]]

abstracting: (p2<=p9)
states: 4,018,032,028,012,002 (15)
abstracting: (88<=p11)
states: 3,666,629,926,611,652 (15)
..abstracting: (871<=p7)
states: 522,083,122,080,520 (14)
..
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.470sec

checking: EF [[EX [AG [[[p5<=410 | 508<=p7] & ~ [904<=p1]]]] & AG [p7<=p4]]]
normalized: E [true U [~ [E [true U ~ [p7<=p4]]] & EX [~ [E [true U ~ [[~ [904<=p1] & [p5<=410 | 508<=p7]]]]]]]]

abstracting: (508<=p7)
states: 1,979,899,839,889,972 (15)
abstracting: (p5<=410)
states: 4,020,040,040,020,004 (15)
abstracting: (904<=p1)
states: 389,554,329,552,388 (14)
.abstracting: (p7<=p4)
states: 6,024,036,024,006 (12)
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.141sec

checking: AG [AX [[AG [p1<=736] | [A [[207<=p0 & p2<=664] U [30<=p7 | 166<=p12]] | EF [~ [21<=p10]]]]]]
normalized: ~ [E [true U EX [~ [[[E [true U ~ [21<=p10]] | [~ [EG [~ [[30<=p7 | 166<=p12]]]] & ~ [E [~ [[30<=p7 | 166<=p12]] U [~ [[207<=p0 & p2<=664]] & ~ [[30<=p7 | 166<=p12]]]]]]] | ~ [E [true U ~ [p1<=736]]]]]]]]

abstracting: (p1<=736)
states: 2,959,809,699,794,948 (15)
abstracting: (166<=p12)
states: 3,353,380,053,363,340 (15)
abstracting: (30<=p7)
states: 3,899,559,319,539,884 (15)
abstracting: (p2<=664)
states: 4,020,040,040,020,004 (15)
abstracting: (207<=p0)
states: 3,188,723,068,707,176 (15)
abstracting: (166<=p12)
states: 3,353,380,053,363,340 (15)
abstracting: (30<=p7)
states: 3,899,559,319,539,884 (15)
abstracting: (166<=p12)
states: 3,353,380,053,363,340 (15)
abstracting: (30<=p7)
states: 3,899,559,319,539,884 (15)
.
EG iterations: 1
abstracting: (21<=p10)
states: 3,935,703,535,683,920 (15)
.-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.183sec

checking: E [EX [[~ [128<=p1] | p8<=474]] U [p10<=395 & [AF [AG [p7<=p11]] & [EG [~ [EX [p1<=536]]] | p11<=817]]]]
normalized: E [EX [[p8<=474 | ~ [128<=p1]]] U [p10<=395 & [[p11<=817 | EG [~ [EX [p1<=536]]]] & ~ [EG [E [true U ~ [p7<=p11]]]]]]]

abstracting: (p7<=p11)
states: 2,012,028,032,018,004 (15)

before gc: list nodes free: 39243

after gc: idd nodes used:3070120, unused:60929880; list nodes free:393809180

before gc: list nodes free: 28771298

after gc: idd nodes used:3070120, unused:60929880; list nodes free:393809180

before gc: list nodes free: 28766298

after gc: idd nodes used:3070120, unused:60929880; list nodes free:393809180

before gc: list nodes free: 28758301

after gc: idd nodes used:3070120, unused:60929880; list nodes free:393809180

before gc: list nodes free: 28750301

after gc: idd nodes used:3070120, unused:60929880; list nodes free:393809180

before gc: list nodes free: 28738301

after gc: idd nodes used:3070120, unused:60929880; list nodes free:393809180
MC time: 11m39.232sec

checking: AG [E [p3<=p10 U A [E [~ [p0<=7] U [p2<=p12 | 480<=p8]] U A [EF [p2<=p1] U AX [p2<=p11]]]]]
normalized: ~ [E [true U ~ [E [p3<=p10 U [~ [EG [~ [[~ [EG [EX [~ [p2<=p11]]]] & ~ [E [EX [~ [p2<=p11]] U [~ [E [true U p2<=p1]] & EX [~ [p2<=p11]]]]]]]]] & ~ [E [~ [[~ [EG [EX [~ [p2<=p11]]]] & ~ [E [EX [~ [p2<=p11]] U [~ [E [true U p2<=p1]] & EX [~ [p2<=p11]]]]]]] U [~ [E [~ [p0<=7] U [p2<=p12 | 480<=p8]]] & ~ [[~ [EG [EX [~ [p2<=p11]]]] & ~ [E [EX [~ [p2<=p11]] U [~ [E [true U p2<=p1]] & EX [~ [p2<=p11]]]]]]]]]]]]]]]

abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
.abstracting: (p2<=p1)
states: 4,018,032,028,012,002 (15)
abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
.abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
..
EG iterations: 1
abstracting: (480<=p8)
states: 2,092,348,512,338,084 (15)
abstracting: (p2<=p12)
states: 4,018,032,028,012,002 (15)
abstracting: (p0<=7)
states: 32,128,192,128,032 (13)
abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
.abstracting: (p2<=p1)
states: 4,018,032,028,012,002 (15)
abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
.abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
..
EG iterations: 1
abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
.abstracting: (p2<=p1)
states: 4,018,032,028,012,002 (15)
abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
.abstracting: (p2<=p11)
states: 4,018,032,028,012,002 (15)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (p3<=p10)
states: 4,018,032,028,012,002 (15)

before gc: list nodes free: 3149906

after gc: idd nodes used:1067192, unused:62932808; list nodes free:406798568
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.483sec

checking: [~ [A [[~ [A [p11<=p6 U p7<=280]] & [p4<=p5 & [856<=p2 | 976<=p11]]] U p9<=897]] & E [AF [[~ [EG [858<=p1]] | p1<=919]] U [p0<=p2 & AG [[~ [[p0<=825 & p7<=p1]] | p1<=p0]]]]]
normalized: [E [~ [EG [~ [[p1<=919 | ~ [EG [858<=p1]]]]]] U [p0<=p2 & ~ [E [true U ~ [[p1<=p0 | ~ [[p0<=825 & p7<=p1]]]]]]]] & ~ [[~ [EG [~ [p9<=897]]] & ~ [E [~ [p9<=897] U [~ [[[p4<=p5 & [856<=p2 | 976<=p11]] & ~ [[~ [EG [~ [p7<=280]]] & ~ [E [~ [p7<=280] U [~ [p11<=p6] & ~ [p7<=280]]]]]]]] & ~ [p9<=897]]]]]]]

abstracting: (p9<=897)
states: 3,606,389,566,371,592 (15)
abstracting: (p7<=280)
states: 1,128,502,748,497,124 (15)
abstracting: (p11<=p6)
states: 2,012,028,032,018,004 (15)
abstracting: (p7<=280)
states: 1,128,502,748,497,124 (15)
abstracting: (p7<=280)
states: 1,128,502,748,497,124 (15)
.
EG iterations: 1
abstracting: (976<=p11)
states: 100,400,600,400,100 (14)
abstracting: (856<=p2)
states: 0
abstracting: (p4<=p5)
states: 2,010,020,020,010,002 (15)
abstracting: (p9<=897)
states: 3,606,389,566,371,592 (15)
abstracting: (p9<=897)
states: 3,606,389,566,371,592 (15)
.
EG iterations: 1
abstracting: (p7<=p1)
states: 2,012,028,032,018,004 (15)
abstracting: (p0<=825)
states: 3,317,235,837,219,304 (15)
abstracting: (p1<=p0)
states: 2,012,028,032,018,004 (15)

before gc: list nodes free: 10240984

after gc: idd nodes used:8747753, unused:55252247; list nodes free:358456636

before gc: list nodes free: 15917835

after gc: idd nodes used:8747720, unused:55252280; list nodes free:358480842

before gc: list nodes free: 15934246

after gc: idd nodes used:8747687, unused:55252313; list nodes free:358498416

before gc: list nodes free: 15938504

after gc: idd nodes used:8747654, unused:55252346; list nodes free:358504384
MC time: 11m20.994sec

checking: [AF [[E [p10<=p11 U p9<=614] | [[~ [312<=p5] & p12<=p13] | p8<=p9]]] & [EG [EF [p12<=79]] & [AF [[EF [497<=p6] | [[~ [p1<=209] & ~ [p11<=622]] | ~ [p6<=909]]]] | AG [[AG [~ [p9<=p4]] | [EX [~ [p12<=535]] | p4<=p8]]]]]]
normalized: [[[~ [E [true U ~ [[[p4<=p8 | EX [~ [p12<=535]]] | ~ [E [true U p9<=p4]]]]]] | ~ [EG [~ [[[~ [p6<=909] | [~ [p11<=622] & ~ [p1<=209]]] | E [true U 497<=p6]]]]]] & EG [E [true U p12<=79]]] & ~ [EG [~ [[[p8<=p9 | [p12<=p13 & ~ [312<=p5]]] | E [p10<=p11 U p9<=614]]]]]]

abstracting: (p9<=614)
states: 2,469,854,769,842,460 (15)
abstracting: (p10<=p11)
states: 2,012,028,032,018,004 (15)
abstracting: (312<=p5)
states: 0
abstracting: (p12<=p13)
states: 2,012,028,032,018,004 (15)
abstracting: (p8<=p9)
states: 2,012,028,032,018,004 (15)
.
EG iterations: 1
abstracting: (p12<=79)
states: 321,281,921,280,320 (14)

EG iterations: 0
abstracting: (497<=p6)
states: 2,024,076,104,066,016 (15)
abstracting: (p1<=209)
states: 843,365,043,360,840 (14)
abstracting: (p11<=622)
states: 2,501,982,961,970,492 (15)
abstracting: (p6<=909)
states: 3,654,581,854,563,640 (15)
.
EG iterations: 1
abstracting: (p9<=p4)
states: 6,024,036,024,006 (12)
abstracting: (p12<=535)
states: 2,152,588,872,578,144 (15)
.abstracting: (p4<=p8)
states: 4,018,032,028,012,002 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.896sec

checking: EX [[A [[[[[p13<=p9 | p11<=352] & E [998<=p12 U p11<=p4]] | AX [p9<=850]] | [p0<=p2 | [318<=p12 | p11<=112]]] U [E [[p7<=p3 | p6<=p10] U EG [p8<=823]] & [[EX [289<=p0] & EG [p3<=p8]] | EF [p11<=530]]]] & [~ [p10<=455] | EX [A [[836<=p11 & p0<=845] U p4<=p0]]]]]
normalized: EX [[[EX [[~ [EG [~ [p4<=p0]]] & ~ [E [~ [p4<=p0] U [~ [[836<=p11 & p0<=845]] & ~ [p4<=p0]]]]]] | ~ [p10<=455]] & [~ [EG [~ [[[E [true U p11<=530] | [EG [p3<=p8] & EX [289<=p0]]] & E [[p7<=p3 | p6<=p10] U EG [p8<=823]]]]]] & ~ [E [~ [[[E [true U p11<=530] | [EG [p3<=p8] & EX [289<=p0]]] & E [[p7<=p3 | p6<=p10] U EG [p8<=823]]]] U [~ [[[p0<=p2 | [318<=p12 | p11<=112]] | [~ [EX [~ [p9<=850]]] | [E [998<=p12 U p11<=p4] & [p13<=p9 | p11<=352]]]]] & ~ [[[E [true U p11<=530] | [EG [p3<=p8] & EX [289<=p0]]] & E [[p7<=p3 | p6<=p10] U EG [p8<=823]]]]]]]]]]

abstracting: (p8<=823)
states: 3,309,203,789,187,296 (15)
.
EG iterations: 1
abstracting: (p6<=p10)
states: 2,012,028,032,018,004 (15)
abstracting: (p7<=p3)
states: 6,024,036,024,006 (12)
abstracting: (289<=p0)
states: 2,859,409,099,394,848 (15)
.abstracting: (p3<=p8)
states: 4,018,032,028,012,002 (15)
.
EG iterations: 1
abstracting: (p11<=530)
states: 2,132,508,752,498,124 (15)
abstracting: (p11<=352)
states: 1,417,656,477,649,412 (15)
abstracting: (p13<=p9)
states: 2,012,028,032,018,004 (15)
abstracting: (p11<=p4)
states: 6,024,036,024,006 (12)
abstracting: (998<=p12)
states: 12,048,072,048,012 (13)
MC time: 10m54.109sec

checking: E [EX [[~ [128<=p1] | p8<=474]] U [p10<=395 & [AF [AG [p7<=p11]] & [EG [~ [EX [p1<=536]]] | p11<=817]]]]
normalized: E [EX [[p8<=474 | ~ [128<=p1]]] U [p10<=395 & [[p11<=817 | EG [~ [EX [p1<=536]]]] & ~ [EG [E [true U ~ [p7<=p11]]]]]]]

abstracting: (p7<=p11)
states: 2,012,028,032,018,004 (15)

before gc: list nodes free: 847865

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37214744

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37210744

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37205744

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37199747

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37191747

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37181747

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37164747

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 37132747

after gc: idd nodes used:9134223, unused:54865777; list nodes free:365920177

before gc: list nodes free: 36890993

after gc: idd nodes used:8828095, unused:55171905; list nodes free:367753905

EG iterations: 0
abstracting: (p1<=536)
states: 2,156,604,896,594,148 (15)
..
EG iterations: 1
abstracting: (p11<=817)
states: 3,285,107,645,091,272 (15)
abstracting: (p10<=395)
states: 1,590,345,510,337,584 (15)
abstracting: (128<=p1)
states: 3,505,988,965,971,492 (15)
abstracting: (p8<=474)
states: 1,907,611,407,601,900 (15)
.-> the formula is FALSE

FORMULA CircadianClock-PT-001000-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 3894672 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101876 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:85028 (5314), effective:15003 (937)

initing FirstDep: 0m 0.000sec


iterations count:9271 (579), effective:2468 (154)

iterations count:1612 (100), effective:267 (16)

iterations count:15021 (938), effective:4002 (250)

iterations count:34 (2), effective:4 (0)

iterations count:4734 (295), effective:1833 (114)

iterations count:44312 (2769), effective:7232 (452)

iterations count:23 (1), effective:3 (0)

iterations count:36129 (2258), effective:5896 (368)

iterations count:2401 (150), effective:795 (49)

iterations count:4916 (307), effective:1960 (122)

sat_reach.icc:155: Timeout: after 698 sec


iterations count:34 (2), effective:4 (0)

iterations count:20 (1), effective:1 (0)

iterations count:34 (2), effective:4 (0)

iterations count:49045 (3065), effective:8516 (532)

iterations count:34 (2), effective:4 (0)

iterations count:6041 (377), effective:1006 (62)

iterations count:20036 (1252), effective:6005 (375)

iterations count:2020 (126), effective:501 (31)

iterations count:736 (46), effective:720 (45)

sat_reach.icc:155: Timeout: after 678 sec


iterations count:6964 (435), effective:1158 (72)

iterations count:45145 (2821), effective:7368 (460)

iterations count:7471 (466), effective:1988 (124)

iterations count:18005 (1125), effective:2999 (187)

iterations count:24857 (1553), effective:4730 (295)

iterations count:370 (23), effective:177 (11)

iterations count:7066 (441), effective:1880 (117)

sat_reach.icc:155: Timeout: after 653 sec


iterations count:5031 (314), effective:2004 (125)

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="CircadianClock-PT-001000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CircadianClock-PT-001000, 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 r074-smll-167814399900121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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