Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 21:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 21:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 21:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 21:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 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 641K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-020-CTLFireability-00
FORMULA_NAME CANConstruction-PT-020-CTLFireability-01
FORMULA_NAME CANConstruction-PT-020-CTLFireability-02
FORMULA_NAME CANConstruction-PT-020-CTLFireability-03
FORMULA_NAME CANConstruction-PT-020-CTLFireability-04
FORMULA_NAME CANConstruction-PT-020-CTLFireability-05
FORMULA_NAME CANConstruction-PT-020-CTLFireability-06
FORMULA_NAME CANConstruction-PT-020-CTLFireability-07
FORMULA_NAME CANConstruction-PT-020-CTLFireability-08
FORMULA_NAME CANConstruction-PT-020-CTLFireability-09
FORMULA_NAME CANConstruction-PT-020-CTLFireability-10
FORMULA_NAME CANConstruction-PT-020-CTLFireability-11
FORMULA_NAME CANConstruction-PT-020-CTLFireability-12
FORMULA_NAME CANConstruction-PT-020-CTLFireability-13
FORMULA_NAME CANConstruction-PT-020-CTLFireability-14
FORMULA_NAME CANConstruction-PT-020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678736350718

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:39:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:39:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:39:16] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2023-03-13 19:39:16] [INFO ] Transformed 1042 places.
[2023-03-13 19:39:16] [INFO ] Transformed 1760 transitions.
[2023-03-13 19:39:16] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 177 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 289 places :
Symmetric choice reduction at 0 with 289 rule applications. Total rules 289 place count 753 transition count 1182
Iterating global reduction 0 with 289 rules applied. Total rules applied 578 place count 753 transition count 1182
Applied a total of 578 rules in 349 ms. Remains 753 /1042 variables (removed 289) and now considering 1182/1760 (removed 578) transitions.
// Phase 1: matrix 1182 rows 753 cols
[2023-03-13 19:39:17] [INFO ] Computed 41 place invariants in 58 ms
[2023-03-13 19:39:20] [INFO ] Implicit Places using invariants in 3031 ms returned []
[2023-03-13 19:39:20] [INFO ] Invariant cache hit.
[2023-03-13 19:39:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-13 19:39:24] [INFO ] Implicit Places using invariants and state equation in 4211 ms returned [12, 26, 40, 54, 68, 82, 138, 152, 166, 222, 236, 250, 264, 278]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 7338 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 739/1042 places, 1182/1760 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 725 transition count 1168
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 725 transition count 1168
Applied a total of 28 rules in 67 ms. Remains 725 /739 variables (removed 14) and now considering 1168/1182 (removed 14) transitions.
// Phase 1: matrix 1168 rows 725 cols
[2023-03-13 19:39:24] [INFO ] Computed 27 place invariants in 15 ms
[2023-03-13 19:39:24] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-13 19:39:24] [INFO ] Invariant cache hit.
[2023-03-13 19:39:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-13 19:39:30] [INFO ] Implicit Places using invariants and state equation in 5335 ms returned []
Implicit Place search using SMT with State Equation took 5933 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 725/1042 places, 1168/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13691 ms. Remains : 725/1042 places, 1168/1760 transitions.
Support contains 177 out of 725 places after structural reductions.
[2023-03-13 19:39:31] [INFO ] Flatten gal took : 273 ms
[2023-03-13 19:39:31] [INFO ] Flatten gal took : 187 ms
[2023-03-13 19:39:31] [INFO ] Input system was already deterministic with 1168 transitions.
Support contains 176 out of 725 places (down from 177) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 912 ms. (steps per millisecond=10 ) properties (out of 121) seen :102
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) 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 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-03-13 19:39:32] [INFO ] Invariant cache hit.
[2023-03-13 19:39:33] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-03-13 19:39:33] [INFO ] [Real]Absence check using 21 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-13 19:39:37] [INFO ] After 3330ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:16
[2023-03-13 19:39:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-13 19:39:37] [INFO ] After 183ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-13 19:39:37] [INFO ] After 4458ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-13 19:39:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 100 ms returned sat
[2023-03-13 19:39:38] [INFO ] [Nat]Absence check using 21 positive and 6 generalized place invariants in 32 ms returned sat
[2023-03-13 19:39:40] [INFO ] After 1237ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-03-13 19:39:41] [INFO ] After 1329ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :2 sat :16
[2023-03-13 19:39:43] [INFO ] After 3346ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 991 ms.
[2023-03-13 19:39:44] [INFO ] After 7050ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 176 ms.
Support contains 51 out of 725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 725 transition count 1060
Reduce places removed 108 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 111 rules applied. Total rules applied 219 place count 617 transition count 1057
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 222 place count 614 transition count 1057
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 222 place count 614 transition count 1040
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 256 place count 597 transition count 1040
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 308 place count 545 transition count 936
Iterating global reduction 3 with 52 rules applied. Total rules applied 360 place count 545 transition count 936
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 365 place count 545 transition count 931
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 370 place count 540 transition count 931
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 406 place count 522 transition count 913
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 408 place count 521 transition count 926
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 413 place count 521 transition count 921
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 418 place count 516 transition count 921
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 426 place count 516 transition count 913
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 434 place count 508 transition count 913
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 450 place count 508 transition count 913
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 451 place count 508 transition count 913
Applied a total of 451 rules in 1282 ms. Remains 508 /725 variables (removed 217) and now considering 913/1168 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1290 ms. Remains : 508/725 places, 913/1168 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 913 rows 508 cols
[2023-03-13 19:39:46] [INFO ] Computed 27 place invariants in 31 ms
[2023-03-13 19:39:47] [INFO ] [Real]Absence check using 21 positive place invariants in 104 ms returned sat
[2023-03-13 19:39:47] [INFO ] [Real]Absence check using 21 positive and 6 generalized place invariants in 51 ms returned sat
[2023-03-13 19:39:48] [INFO ] After 1622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 19:39:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-13 19:39:48] [INFO ] [Nat]Absence check using 21 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-13 19:39:49] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 19:39:49] [INFO ] State equation strengthened by 799 read => feed constraints.
[2023-03-13 19:39:49] [INFO ] After 469ms SMT Verify possible using 799 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 19:39:50] [INFO ] After 1053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-03-13 19:39:50] [INFO ] After 2647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 8 ms.
Support contains 34 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 913/913 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 506 transition count 909
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 506 transition count 909
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 498 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 498 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 497 transition count 900
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 497 transition count 900
Applied a total of 23 rules in 606 ms. Remains 497 /508 variables (removed 11) and now considering 900/913 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 617 ms. Remains : 497/508 places, 900/913 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 900 rows 497 cols
[2023-03-13 19:39:52] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-13 19:39:52] [INFO ] [Real]Absence check using 21 positive place invariants in 126 ms returned sat
[2023-03-13 19:39:52] [INFO ] [Real]Absence check using 21 positive and 6 generalized place invariants in 41 ms returned sat
[2023-03-13 19:39:55] [INFO ] After 2929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 19:39:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-13 19:39:55] [INFO ] [Nat]Absence check using 21 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-13 19:39:55] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 19:39:55] [INFO ] State equation strengthened by 804 read => feed constraints.
[2023-03-13 19:39:56] [INFO ] After 333ms SMT Verify possible using 804 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 19:39:56] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-13 19:39:56] [INFO ] After 1761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 16 ms.
Support contains 20 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 900/900 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 497 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 496 transition count 899
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 494 transition count 895
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 494 transition count 895
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 494 transition count 894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 493 transition count 894
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 9 place count 492 transition count 892
Iterating global reduction 4 with 1 rules applied. Total rules applied 10 place count 492 transition count 892
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 20 place count 487 transition count 887
Applied a total of 20 rules in 353 ms. Remains 487 /497 variables (removed 10) and now considering 887/900 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 487/497 places, 887/900 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 887 rows 487 cols
[2023-03-13 19:39:57] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-13 19:39:58] [INFO ] [Real]Absence check using 21 positive place invariants in 81 ms returned sat
[2023-03-13 19:39:58] [INFO ] [Real]Absence check using 21 positive and 6 generalized place invariants in 48 ms returned sat
[2023-03-13 19:39:58] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:39:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-13 19:39:58] [INFO ] [Nat]Absence check using 21 positive and 6 generalized place invariants in 48 ms returned sat
[2023-03-13 19:39:58] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:39:59] [INFO ] State equation strengthened by 808 read => feed constraints.
[2023-03-13 19:39:59] [INFO ] After 151ms SMT Verify possible using 808 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:39:59] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-13 19:39:59] [INFO ] After 1126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 17 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 887/887 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 485 transition count 885
Applied a total of 4 rules in 112 ms. Remains 485 /487 variables (removed 2) and now considering 885/887 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 485/487 places, 885/887 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 231 ms. (steps per millisecond=43 ) 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
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 296695 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296695 steps, saw 51562 distinct states, run finished after 3015 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 885 rows 485 cols
[2023-03-13 19:40:02] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-13 19:40:03] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-13 19:40:03] [INFO ] [Real]Absence check using 21 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-13 19:40:03] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:40:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-13 19:40:03] [INFO ] [Nat]Absence check using 21 positive and 6 generalized place invariants in 35 ms returned sat
[2023-03-13 19:40:03] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:40:03] [INFO ] State equation strengthened by 809 read => feed constraints.
[2023-03-13 19:40:03] [INFO ] After 175ms SMT Verify possible using 809 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:40:04] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-13 19:40:04] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 17 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 885/885 transitions.
Applied a total of 0 rules in 84 ms. Remains 485 /485 variables (removed 0) and now considering 885/885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 485/485 places, 885/885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 885/885 transitions.
Applied a total of 0 rules in 97 ms. Remains 485 /485 variables (removed 0) and now considering 885/885 (removed 0) transitions.
[2023-03-13 19:40:04] [INFO ] Invariant cache hit.
[2023-03-13 19:40:04] [INFO ] Implicit Places using invariants in 449 ms returned [25, 29, 36, 53, 60, 64]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 472 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 479/485 places, 885/885 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 476 transition count 882
Applied a total of 6 rules in 126 ms. Remains 476 /479 variables (removed 3) and now considering 882/885 (removed 3) transitions.
// Phase 1: matrix 882 rows 476 cols
[2023-03-13 19:40:05] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-13 19:40:08] [INFO ] Implicit Places using invariants in 3655 ms returned []
[2023-03-13 19:40:08] [INFO ] Invariant cache hit.
[2023-03-13 19:40:09] [INFO ] State equation strengthened by 804 read => feed constraints.
[2023-03-13 19:40:11] [INFO ] Implicit Places using invariants and state equation in 3154 ms returned []
Implicit Place search using SMT with State Equation took 6857 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 476/485 places, 882/885 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7560 ms. Remains : 476/485 places, 882/885 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 255198 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255198 steps, saw 45028 distinct states, run finished after 3013 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 19:40:15] [INFO ] Invariant cache hit.
[2023-03-13 19:40:15] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-13 19:40:15] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:40:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-13 19:40:16] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:40:16] [INFO ] State equation strengthened by 804 read => feed constraints.
[2023-03-13 19:40:16] [INFO ] After 173ms SMT Verify possible using 804 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:40:16] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-13 19:40:16] [INFO ] After 975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 17 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 882/882 transitions.
Applied a total of 0 rules in 37 ms. Remains 476 /476 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 476/476 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 882/882 transitions.
Applied a total of 0 rules in 87 ms. Remains 476 /476 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-13 19:40:16] [INFO ] Invariant cache hit.
[2023-03-13 19:40:24] [INFO ] Implicit Places using invariants in 8136 ms returned []
[2023-03-13 19:40:24] [INFO ] Invariant cache hit.
[2023-03-13 19:40:25] [INFO ] State equation strengthened by 804 read => feed constraints.
[2023-03-13 19:40:30] [INFO ] Implicit Places using invariants and state equation in 5508 ms returned []
Implicit Place search using SMT with State Equation took 13695 ms to find 0 implicit places.
[2023-03-13 19:40:30] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-13 19:40:30] [INFO ] Invariant cache hit.
[2023-03-13 19:40:31] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14537 ms. Remains : 476/476 places, 882/882 transitions.
Graph (trivial) has 751 edges and 476 vertex of which 349 / 476 are part of one of the 17 SCC in 3 ms
Free SCC test removed 332 places
Drop transitions removed 648 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 666 transitions.
Graph (complete) has 287 edges and 144 vertex of which 106 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 106 transition count 153
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 1 with 73 rules applied. Total rules applied 117 place count 87 transition count 99
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 188 place count 50 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 188 place count 50 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 49 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 47 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 47 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 196 place count 47 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 196 place count 47 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 198 place count 46 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 45 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 45 transition count 57
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 45 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 44 transition count 56
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 210 place count 44 transition count 49
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 217 place count 37 transition count 49
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 222 place count 37 transition count 49
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 226 place count 33 transition count 45
Iterating global reduction 7 with 4 rules applied. Total rules applied 230 place count 33 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 32 transition count 44
Applied a total of 231 rules in 49 ms. Remains 32 /476 variables (removed 444) and now considering 44/882 (removed 838) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 32 cols
[2023-03-13 19:40:31] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 19:40:31] [INFO ] [Real]Absence check using 7 positive place invariants in 27 ms returned sat
[2023-03-13 19:40:31] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:40:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 19:40:31] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:40:32] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-13 19:40:32] [INFO ] After 708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-13 19:40:32] [INFO ] Flatten gal took : 127 ms
[2023-03-13 19:40:32] [INFO ] Flatten gal took : 143 ms
[2023-03-13 19:40:32] [INFO ] Input system was already deterministic with 1168 transitions.
Support contains 166 out of 725 places (down from 168) after GAL structural reductions.
Computed a total of 67 stabilizing places and 86 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 654 transition count 1026
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 654 transition count 1026
Applied a total of 142 rules in 67 ms. Remains 654 /725 variables (removed 71) and now considering 1026/1168 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 654/725 places, 1026/1168 transitions.
[2023-03-13 19:40:33] [INFO ] Flatten gal took : 78 ms
[2023-03-13 19:40:33] [INFO ] Flatten gal took : 90 ms
[2023-03-13 19:40:33] [INFO ] Input system was already deterministic with 1026 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 725 transition count 1046
Reduce places removed 122 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 245 place count 603 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 602 transition count 1045
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 246 place count 602 transition count 1031
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 274 place count 588 transition count 1031
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 339 place count 523 transition count 901
Iterating global reduction 3 with 65 rules applied. Total rules applied 404 place count 523 transition count 901
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 413 place count 523 transition count 892
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 422 place count 514 transition count 892
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 468 place count 491 transition count 869
Applied a total of 468 rules in 302 ms. Remains 491 /725 variables (removed 234) and now considering 869/1168 (removed 299) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 310 ms. Remains : 491/725 places, 869/1168 transitions.
[2023-03-13 19:40:33] [INFO ] Flatten gal took : 76 ms
[2023-03-13 19:40:33] [INFO ] Flatten gal took : 78 ms
[2023-03-13 19:40:33] [INFO ] Input system was already deterministic with 869 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 656 transition count 1030
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 656 transition count 1030
Applied a total of 138 rules in 70 ms. Remains 656 /725 variables (removed 69) and now considering 1030/1168 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 656/725 places, 1030/1168 transitions.
[2023-03-13 19:40:34] [INFO ] Flatten gal took : 55 ms
[2023-03-13 19:40:34] [INFO ] Flatten gal took : 91 ms
[2023-03-13 19:40:34] [INFO ] Input system was already deterministic with 1030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 655 transition count 1028
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 655 transition count 1028
Applied a total of 140 rules in 78 ms. Remains 655 /725 variables (removed 70) and now considering 1028/1168 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 655/725 places, 1028/1168 transitions.
[2023-03-13 19:40:34] [INFO ] Flatten gal took : 82 ms
[2023-03-13 19:40:34] [INFO ] Flatten gal took : 72 ms
[2023-03-13 19:40:34] [INFO ] Input system was already deterministic with 1028 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 657 transition count 1032
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 657 transition count 1032
Applied a total of 136 rules in 62 ms. Remains 657 /725 variables (removed 68) and now considering 1032/1168 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 657/725 places, 1032/1168 transitions.
[2023-03-13 19:40:34] [INFO ] Flatten gal took : 69 ms
[2023-03-13 19:40:35] [INFO ] Flatten gal took : 88 ms
[2023-03-13 19:40:35] [INFO ] Input system was already deterministic with 1032 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 656 transition count 1030
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 656 transition count 1030
Applied a total of 138 rules in 62 ms. Remains 656 /725 variables (removed 69) and now considering 1030/1168 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 656/725 places, 1030/1168 transitions.
[2023-03-13 19:40:35] [INFO ] Flatten gal took : 126 ms
[2023-03-13 19:40:35] [INFO ] Flatten gal took : 52 ms
[2023-03-13 19:40:35] [INFO ] Input system was already deterministic with 1030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 656 transition count 1030
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 656 transition count 1030
Applied a total of 138 rules in 95 ms. Remains 656 /725 variables (removed 69) and now considering 1030/1168 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 656/725 places, 1030/1168 transitions.
[2023-03-13 19:40:35] [INFO ] Flatten gal took : 88 ms
[2023-03-13 19:40:35] [INFO ] Flatten gal took : 78 ms
[2023-03-13 19:40:36] [INFO ] Input system was already deterministic with 1030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 668 transition count 1054
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 668 transition count 1054
Applied a total of 114 rules in 65 ms. Remains 668 /725 variables (removed 57) and now considering 1054/1168 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 668/725 places, 1054/1168 transitions.
[2023-03-13 19:40:36] [INFO ] Flatten gal took : 83 ms
[2023-03-13 19:40:36] [INFO ] Flatten gal took : 76 ms
[2023-03-13 19:40:36] [INFO ] Input system was already deterministic with 1054 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 725 transition count 1051
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 608 transition count 1049
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 238 place count 606 transition count 1049
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 238 place count 606 transition count 1034
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 268 place count 591 transition count 1034
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 333 place count 526 transition count 904
Iterating global reduction 3 with 65 rules applied. Total rules applied 398 place count 526 transition count 904
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 408 place count 526 transition count 894
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 418 place count 516 transition count 894
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 456 place count 497 transition count 875
Applied a total of 456 rules in 219 ms. Remains 497 /725 variables (removed 228) and now considering 875/1168 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 226 ms. Remains : 497/725 places, 875/1168 transitions.
[2023-03-13 19:40:36] [INFO ] Flatten gal took : 56 ms
[2023-03-13 19:40:36] [INFO ] Flatten gal took : 75 ms
[2023-03-13 19:40:37] [INFO ] Input system was already deterministic with 875 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 656 transition count 1030
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 656 transition count 1030
Applied a total of 138 rules in 63 ms. Remains 656 /725 variables (removed 69) and now considering 1030/1168 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 656/725 places, 1030/1168 transitions.
[2023-03-13 19:40:37] [INFO ] Flatten gal took : 55 ms
[2023-03-13 19:40:37] [INFO ] Flatten gal took : 53 ms
[2023-03-13 19:40:37] [INFO ] Input system was already deterministic with 1030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 657 transition count 1032
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 657 transition count 1032
Applied a total of 136 rules in 57 ms. Remains 657 /725 variables (removed 68) and now considering 1032/1168 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 657/725 places, 1032/1168 transitions.
[2023-03-13 19:40:37] [INFO ] Flatten gal took : 62 ms
[2023-03-13 19:40:37] [INFO ] Flatten gal took : 68 ms
[2023-03-13 19:40:37] [INFO ] Input system was already deterministic with 1032 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 725 transition count 1046
Reduce places removed 122 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 245 place count 603 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 602 transition count 1045
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 246 place count 602 transition count 1029
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 278 place count 586 transition count 1029
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 345 place count 519 transition count 895
Iterating global reduction 3 with 67 rules applied. Total rules applied 412 place count 519 transition count 895
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 11 rules applied. Total rules applied 423 place count 519 transition count 884
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 434 place count 508 transition count 884
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 470 place count 490 transition count 866
Applied a total of 470 rules in 204 ms. Remains 490 /725 variables (removed 235) and now considering 866/1168 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 214 ms. Remains : 490/725 places, 866/1168 transitions.
[2023-03-13 19:40:38] [INFO ] Flatten gal took : 56 ms
[2023-03-13 19:40:38] [INFO ] Flatten gal took : 41 ms
[2023-03-13 19:40:38] [INFO ] Input system was already deterministic with 866 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 670 transition count 1058
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 670 transition count 1058
Applied a total of 110 rules in 59 ms. Remains 670 /725 variables (removed 55) and now considering 1058/1168 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 670/725 places, 1058/1168 transitions.
[2023-03-13 19:40:38] [INFO ] Flatten gal took : 56 ms
[2023-03-13 19:40:38] [INFO ] Flatten gal took : 68 ms
[2023-03-13 19:40:38] [INFO ] Input system was already deterministic with 1058 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 655 transition count 1028
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 655 transition count 1028
Applied a total of 140 rules in 76 ms. Remains 655 /725 variables (removed 70) and now considering 1028/1168 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 655/725 places, 1028/1168 transitions.
[2023-03-13 19:40:38] [INFO ] Flatten gal took : 62 ms
[2023-03-13 19:40:38] [INFO ] Flatten gal took : 66 ms
[2023-03-13 19:40:39] [INFO ] Input system was already deterministic with 1028 transitions.
Starting structural reductions in LTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 659 transition count 1036
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 659 transition count 1036
Applied a total of 132 rules in 156 ms. Remains 659 /725 variables (removed 66) and now considering 1036/1168 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 659/725 places, 1036/1168 transitions.
[2023-03-13 19:40:39] [INFO ] Flatten gal took : 61 ms
[2023-03-13 19:40:39] [INFO ] Flatten gal took : 57 ms
[2023-03-13 19:40:39] [INFO ] Input system was already deterministic with 1036 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 725/725 places, 1168/1168 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 725 transition count 1044
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 248 place count 601 transition count 1044
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 248 place count 601 transition count 1030
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 276 place count 587 transition count 1030
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 345 place count 518 transition count 892
Iterating global reduction 2 with 69 rules applied. Total rules applied 414 place count 518 transition count 892
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 426 place count 518 transition count 880
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 438 place count 506 transition count 880
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 482 place count 484 transition count 858
Applied a total of 482 rules in 201 ms. Remains 484 /725 variables (removed 241) and now considering 858/1168 (removed 310) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 484/725 places, 858/1168 transitions.
[2023-03-13 19:40:39] [INFO ] Flatten gal took : 48 ms
[2023-03-13 19:40:39] [INFO ] Flatten gal took : 42 ms
[2023-03-13 19:40:40] [INFO ] Input system was already deterministic with 858 transitions.
[2023-03-13 19:40:40] [INFO ] Flatten gal took : 71 ms
[2023-03-13 19:40:40] [INFO ] Flatten gal took : 68 ms
[2023-03-13 19:40:40] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 22 ms.
[2023-03-13 19:40:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 725 places, 1168 transitions and 3960 arcs took 19 ms.
Total runtime 84658 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 725 NrTr: 1168 NrArc: 3960)

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

net check time: 0m 0.000sec

init dd package: 0m 2.930sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 7339600 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16095400 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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.004sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-020"
export BK_EXAMINATION="CTLFireability"
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 CANConstruction-PT-020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696000626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-020.tgz
mv CANConstruction-PT-020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;