About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S24C03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6402.571 | 3600000.00 | 3666441.00 | 7819.50 | FTT?????TFF???F? | normal |
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.r234-tall-167856420800809.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 MultiCrashLeafsetExtension-PT-S24C03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800809
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 13K Feb 26 02:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 02:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 02:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 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 8.8M 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 MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679605056905
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=MultiCrashLeafsetExtension-PT-S24C03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 20:57:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 20:57:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:57:38] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2023-03-23 20:57:38] [INFO ] Transformed 8390 places.
[2023-03-23 20:57:38] [INFO ] Transformed 12757 transitions.
[2023-03-23 20:57:38] [INFO ] Parsed PT model containing 8390 places and 12757 transitions and 52526 arcs in 630 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Support contains 151 out of 8390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8390/8390 places, 12757/12757 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 8357 transition count 12757
Discarding 1754 places :
Symmetric choice reduction at 1 with 1754 rule applications. Total rules 1787 place count 6603 transition count 11003
Iterating global reduction 1 with 1754 rules applied. Total rules applied 3541 place count 6603 transition count 11003
Discarding 1577 places :
Symmetric choice reduction at 1 with 1577 rule applications. Total rules 5118 place count 5026 transition count 9426
Iterating global reduction 1 with 1577 rules applied. Total rules applied 6695 place count 5026 transition count 9426
Discarding 470 places :
Symmetric choice reduction at 1 with 470 rule applications. Total rules 7165 place count 4556 transition count 8016
Iterating global reduction 1 with 470 rules applied. Total rules applied 7635 place count 4556 transition count 8016
Applied a total of 7635 rules in 2808 ms. Remains 4556 /8390 variables (removed 3834) and now considering 8016/12757 (removed 4741) transitions.
[2023-03-23 20:57:42] [INFO ] Flow matrix only has 7416 transitions (discarded 600 similar events)
// Phase 1: matrix 7416 rows 4556 cols
[2023-03-23 20:57:42] [INFO ] Computed 834 place invariants in 384 ms
[2023-03-23 20:57:45] [INFO ] Implicit Places using invariants in 3731 ms returned []
[2023-03-23 20:57:45] [INFO ] Flow matrix only has 7416 transitions (discarded 600 similar events)
[2023-03-23 20:57:45] [INFO ] Invariant cache hit.
[2023-03-23 20:57:48] [INFO ] Implicit Places using invariants and state equation in 3218 ms returned []
Implicit Place search using SMT with State Equation took 6978 ms to find 0 implicit places.
[2023-03-23 20:57:48] [INFO ] Flow matrix only has 7416 transitions (discarded 600 similar events)
[2023-03-23 20:57:48] [INFO ] Invariant cache hit.
[2023-03-23 20:57:53] [INFO ] Dead Transitions using invariants and state equation in 4582 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4556/8390 places, 8016/12757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14378 ms. Remains : 4556/8390 places, 8016/12757 transitions.
Support contains 151 out of 4556 places after structural reductions.
[2023-03-23 20:57:54] [INFO ] Flatten gal took : 464 ms
[2023-03-23 20:57:54] [INFO ] Flatten gal took : 284 ms
[2023-03-23 20:57:55] [INFO ] Input system was already deterministic with 8016 transitions.
Support contains 143 out of 4556 places (down from 151) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 79) seen :12
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 67) seen :1
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 66) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 65) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 64) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 62) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 62) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 60) seen :1
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 59) seen :0
Running SMT prover for 59 properties.
[2023-03-23 20:57:56] [INFO ] Flow matrix only has 7416 transitions (discarded 600 similar events)
[2023-03-23 20:57:56] [INFO ] Invariant cache hit.
[2023-03-23 20:58:00] [INFO ] After 4023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:59
[2023-03-23 20:58:04] [INFO ] [Nat]Absence check using 47 positive place invariants in 60 ms returned sat
[2023-03-23 20:58:04] [INFO ] [Nat]Absence check using 47 positive and 787 generalized place invariants in 243 ms returned sat
[2023-03-23 20:58:16] [INFO ] After 9914ms SMT Verify possible using state equation in natural domain returned unsat :35 sat :24
[2023-03-23 20:58:16] [INFO ] State equation strengthened by 2862 read => feed constraints.
[2023-03-23 20:58:25] [INFO ] After 9553ms SMT Verify possible using 2862 Read/Feed constraints in natural domain returned unsat :47 sat :11
[2023-03-23 20:58:25] [INFO ] After 9554ms SMT Verify possible using trap constraints in natural domain returned unsat :47 sat :11
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 20:58:25] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :47 sat :11
Fused 59 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 36 out of 4556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4556 transition count 7986
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 4526 transition count 7986
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 60 place count 4526 transition count 7836
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 360 place count 4376 transition count 7836
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 397 place count 4339 transition count 7785
Iterating global reduction 2 with 37 rules applied. Total rules applied 434 place count 4339 transition count 7785
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 462 place count 4311 transition count 7701
Iterating global reduction 2 with 28 rules applied. Total rules applied 490 place count 4311 transition count 7701
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 552 place count 4280 transition count 7670
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 580 place count 4252 transition count 7642
Iterating global reduction 2 with 28 rules applied. Total rules applied 608 place count 4252 transition count 7642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 608 place count 4252 transition count 7641
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 4251 transition count 7641
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 637 place count 4224 transition count 7560
Iterating global reduction 2 with 27 rules applied. Total rules applied 664 place count 4224 transition count 7560
Free-agglomeration rule (complex) applied 345 times.
Iterating global reduction 2 with 345 rules applied. Total rules applied 1009 place count 4224 transition count 8191
Reduce places removed 345 places and 0 transitions.
Iterating post reduction 2 with 345 rules applied. Total rules applied 1354 place count 3879 transition count 8191
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 3 with 125 rules applied. Total rules applied 1479 place count 3879 transition count 8191
Applied a total of 1479 rules in 4313 ms. Remains 3879 /4556 variables (removed 677) and now considering 8191/8016 (removed -175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4315 ms. Remains : 3879/4556 places, 8191/8016 transitions.
Incomplete random walk after 10000 steps, including 514 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2023-03-23 20:58:30] [INFO ] Flow matrix only has 7306 transitions (discarded 885 similar events)
// Phase 1: matrix 7306 rows 3879 cols
[2023-03-23 20:58:31] [INFO ] Computed 834 place invariants in 193 ms
[2023-03-23 20:58:31] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 20:58:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-23 20:58:32] [INFO ] [Nat]Absence check using 49 positive and 785 generalized place invariants in 205 ms returned sat
[2023-03-23 20:58:37] [INFO ] After 4452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 20:58:37] [INFO ] State equation strengthened by 3714 read => feed constraints.
[2023-03-23 20:58:47] [INFO ] After 9454ms SMT Verify possible using 3714 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-23 20:58:52] [INFO ] Deduced a trap composed of 390 places in 3701 ms of which 16 ms to minimize.
[2023-03-23 20:58:56] [INFO ] Deduced a trap composed of 166 places in 3839 ms of which 6 ms to minimize.
[2023-03-23 20:59:00] [INFO ] Deduced a trap composed of 171 places in 3836 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:59:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:59:00] [INFO ] After 28403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 19 out of 3879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3879/3879 places, 8191/8191 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3879 transition count 8186
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3874 transition count 8186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 3873 transition count 8185
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 3873 transition count 8185
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 3873 transition count 8223
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 3867 transition count 8223
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 3865 transition count 8221
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 3865 transition count 8221
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 34 place count 3865 transition count 8221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 40 place count 3859 transition count 8215
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 3859 transition count 8215
Applied a total of 46 rules in 1877 ms. Remains 3859 /3879 variables (removed 20) and now considering 8215/8191 (removed -24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1877 ms. Remains : 3859/3879 places, 8215/8191 transitions.
Incomplete random walk after 10000 steps, including 518 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 20:59:02] [INFO ] Flow matrix only has 7330 transitions (discarded 885 similar events)
// Phase 1: matrix 7330 rows 3859 cols
[2023-03-23 20:59:02] [INFO ] Computed 834 place invariants in 201 ms
[2023-03-23 20:59:03] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 20:59:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 56 ms returned sat
[2023-03-23 20:59:04] [INFO ] [Nat]Absence check using 49 positive and 785 generalized place invariants in 205 ms returned sat
[2023-03-23 20:59:09] [INFO ] After 4653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 20:59:09] [INFO ] State equation strengthened by 3758 read => feed constraints.
[2023-03-23 20:59:18] [INFO ] After 9116ms SMT Verify possible using 3758 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 20:59:23] [INFO ] Deduced a trap composed of 398 places in 3606 ms of which 4 ms to minimize.
[2023-03-23 20:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4016 ms
[2023-03-23 20:59:28] [INFO ] Deduced a trap composed of 301 places in 3516 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:59:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:59:28] [INFO ] After 25380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 9 ms.
Support contains 17 out of 3859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3859/3859 places, 8215/8215 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3859 transition count 8213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3857 transition count 8213
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 3857 transition count 8212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3856 transition count 8212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 3855 transition count 8211
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 3855 transition count 8211
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 3855 transition count 8211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 3854 transition count 8210
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 3854 transition count 8210
Applied a total of 11 rules in 1579 ms. Remains 3854 /3859 variables (removed 5) and now considering 8210/8215 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1579 ms. Remains : 3854/3859 places, 8210/8215 transitions.
Incomplete random walk after 10000 steps, including 519 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 20:59:31] [INFO ] Flow matrix only has 7325 transitions (discarded 885 similar events)
// Phase 1: matrix 7325 rows 3854 cols
[2023-03-23 20:59:31] [INFO ] Computed 834 place invariants in 179 ms
[2023-03-23 20:59:31] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 20:59:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 54 ms returned sat
[2023-03-23 20:59:32] [INFO ] [Nat]Absence check using 49 positive and 785 generalized place invariants in 206 ms returned sat
[2023-03-23 20:59:36] [INFO ] After 4133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 20:59:36] [INFO ] State equation strengthened by 3758 read => feed constraints.
[2023-03-23 20:59:53] [INFO ] After 16703ms SMT Verify possible using 3758 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 20:59:57] [INFO ] Deduced a trap composed of 360 places in 3363 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:59:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:59:57] [INFO ] After 25922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 12 ms.
Support contains 10 out of 3854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3854/3854 places, 8210/8210 transitions.
Graph (complete) has 27067 edges and 3854 vertex of which 3853 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3853 transition count 8208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 3851 transition count 8208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 3850 transition count 8207
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 3850 transition count 8207
Applied a total of 7 rules in 967 ms. Remains 3850 /3854 variables (removed 4) and now considering 8207/8210 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 3850/3854 places, 8207/8210 transitions.
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 20:59:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-23 20:59:58] [INFO ] Flatten gal took : 221 ms
[2023-03-23 20:59:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 20:59:59] [INFO ] Flatten gal took : 235 ms
[2023-03-23 20:59:59] [INFO ] Input system was already deterministic with 8016 transitions.
Support contains 36 out of 4556 places (down from 60) after GAL structural reductions.
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C03-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1932 stabilizing places and 2815 stable transitions
Graph (complete) has 27895 edges and 4556 vertex of which 4555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Starting structural reductions in LTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4555 transition count 8016
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 84 place count 4472 transition count 7913
Iterating global reduction 1 with 83 rules applied. Total rules applied 167 place count 4472 transition count 7913
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 238 place count 4401 transition count 7780
Iterating global reduction 1 with 71 rules applied. Total rules applied 309 place count 4401 transition count 7780
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 348 place count 4362 transition count 7663
Iterating global reduction 1 with 39 rules applied. Total rules applied 387 place count 4362 transition count 7663
Applied a total of 387 rules in 1326 ms. Remains 4362 /4556 variables (removed 194) and now considering 7663/8016 (removed 353) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1327 ms. Remains : 4362/4556 places, 7663/8016 transitions.
[2023-03-23 21:00:01] [INFO ] Flatten gal took : 188 ms
[2023-03-23 21:00:01] [INFO ] Flatten gal took : 209 ms
[2023-03-23 21:00:01] [INFO ] Input system was already deterministic with 7663 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4555 transition count 8016
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 80 place count 4476 transition count 7917
Iterating global reduction 1 with 79 rules applied. Total rules applied 159 place count 4476 transition count 7917
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 226 place count 4409 transition count 7792
Iterating global reduction 1 with 67 rules applied. Total rules applied 293 place count 4409 transition count 7792
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 330 place count 4372 transition count 7681
Iterating global reduction 1 with 37 rules applied. Total rules applied 367 place count 4372 transition count 7681
Applied a total of 367 rules in 1362 ms. Remains 4372 /4556 variables (removed 184) and now considering 7681/8016 (removed 335) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1363 ms. Remains : 4372/4556 places, 7681/8016 transitions.
[2023-03-23 21:00:03] [INFO ] Flatten gal took : 189 ms
[2023-03-23 21:00:03] [INFO ] Flatten gal took : 207 ms
[2023-03-23 21:00:03] [INFO ] Input system was already deterministic with 7681 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4555 transition count 8016
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 82 place count 4474 transition count 7915
Iterating global reduction 1 with 81 rules applied. Total rules applied 163 place count 4474 transition count 7915
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 232 place count 4405 transition count 7784
Iterating global reduction 1 with 69 rules applied. Total rules applied 301 place count 4405 transition count 7784
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 338 place count 4368 transition count 7673
Iterating global reduction 1 with 37 rules applied. Total rules applied 375 place count 4368 transition count 7673
Applied a total of 375 rules in 1406 ms. Remains 4368 /4556 variables (removed 188) and now considering 7673/8016 (removed 343) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1406 ms. Remains : 4368/4556 places, 7673/8016 transitions.
[2023-03-23 21:00:05] [INFO ] Flatten gal took : 181 ms
[2023-03-23 21:00:05] [INFO ] Flatten gal took : 205 ms
[2023-03-23 21:00:06] [INFO ] Input system was already deterministic with 7673 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4555 transition count 8016
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 82 place count 4474 transition count 7917
Iterating global reduction 1 with 81 rules applied. Total rules applied 163 place count 4474 transition count 7917
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 233 place count 4404 transition count 7785
Iterating global reduction 1 with 70 rules applied. Total rules applied 303 place count 4404 transition count 7785
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 341 place count 4366 transition count 7671
Iterating global reduction 1 with 38 rules applied. Total rules applied 379 place count 4366 transition count 7671
Applied a total of 379 rules in 1340 ms. Remains 4366 /4556 variables (removed 190) and now considering 7671/8016 (removed 345) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 4366/4556 places, 7671/8016 transitions.
[2023-03-23 21:00:07] [INFO ] Flatten gal took : 179 ms
[2023-03-23 21:00:07] [INFO ] Flatten gal took : 204 ms
[2023-03-23 21:00:08] [INFO ] Input system was already deterministic with 7671 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Graph (complete) has 27895 edges and 4556 vertex of which 4555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 4555 transition count 7978
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 4517 transition count 7978
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 77 place count 4517 transition count 7828
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 377 place count 4367 transition count 7828
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 425 place count 4319 transition count 7760
Iterating global reduction 2 with 48 rules applied. Total rules applied 473 place count 4319 transition count 7760
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 509 place count 4283 transition count 7652
Iterating global reduction 2 with 36 rules applied. Total rules applied 545 place count 4283 transition count 7652
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 607 place count 4252 transition count 7621
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 640 place count 4219 transition count 7588
Iterating global reduction 2 with 33 rules applied. Total rules applied 673 place count 4219 transition count 7588
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 673 place count 4219 transition count 7584
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 681 place count 4215 transition count 7584
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 713 place count 4183 transition count 7488
Iterating global reduction 2 with 32 rules applied. Total rules applied 745 place count 4183 transition count 7488
Applied a total of 745 rules in 2887 ms. Remains 4183 /4556 variables (removed 373) and now considering 7488/8016 (removed 528) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2888 ms. Remains : 4183/4556 places, 7488/8016 transitions.
[2023-03-23 21:00:11] [INFO ] Flatten gal took : 174 ms
[2023-03-23 21:00:11] [INFO ] Flatten gal took : 198 ms
[2023-03-23 21:00:11] [INFO ] Input system was already deterministic with 7488 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Graph (complete) has 27895 edges and 4556 vertex of which 4555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 4555 transition count 7977
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 4516 transition count 7977
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 79 place count 4516 transition count 7827
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 379 place count 4366 transition count 7827
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 427 place count 4318 transition count 7759
Iterating global reduction 2 with 48 rules applied. Total rules applied 475 place count 4318 transition count 7759
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 511 place count 4282 transition count 7651
Iterating global reduction 2 with 36 rules applied. Total rules applied 547 place count 4282 transition count 7651
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 609 place count 4251 transition count 7620
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 642 place count 4218 transition count 7587
Iterating global reduction 2 with 33 rules applied. Total rules applied 675 place count 4218 transition count 7587
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 675 place count 4218 transition count 7583
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 683 place count 4214 transition count 7583
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 715 place count 4182 transition count 7487
Iterating global reduction 2 with 32 rules applied. Total rules applied 747 place count 4182 transition count 7487
Applied a total of 747 rules in 2593 ms. Remains 4182 /4556 variables (removed 374) and now considering 7487/8016 (removed 529) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2593 ms. Remains : 4182/4556 places, 7487/8016 transitions.
[2023-03-23 21:00:14] [INFO ] Flatten gal took : 216 ms
[2023-03-23 21:00:14] [INFO ] Flatten gal took : 188 ms
[2023-03-23 21:00:15] [INFO ] Input system was already deterministic with 7487 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 4556 transition count 7978
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 4518 transition count 7978
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 76 place count 4518 transition count 7828
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 376 place count 4368 transition count 7828
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 422 place count 4322 transition count 7766
Iterating global reduction 2 with 46 rules applied. Total rules applied 468 place count 4322 transition count 7766
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 504 place count 4286 transition count 7658
Iterating global reduction 2 with 36 rules applied. Total rules applied 540 place count 4286 transition count 7658
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 602 place count 4255 transition count 7627
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 634 place count 4223 transition count 7595
Iterating global reduction 2 with 32 rules applied. Total rules applied 666 place count 4223 transition count 7595
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 666 place count 4223 transition count 7592
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 672 place count 4220 transition count 7592
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 703 place count 4189 transition count 7499
Iterating global reduction 2 with 31 rules applied. Total rules applied 734 place count 4189 transition count 7499
Applied a total of 734 rules in 2485 ms. Remains 4189 /4556 variables (removed 367) and now considering 7499/8016 (removed 517) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2485 ms. Remains : 4189/4556 places, 7499/8016 transitions.
[2023-03-23 21:00:18] [INFO ] Flatten gal took : 176 ms
[2023-03-23 21:00:18] [INFO ] Flatten gal took : 197 ms
[2023-03-23 21:00:18] [INFO ] Input system was already deterministic with 7499 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Graph (complete) has 27895 edges and 4556 vertex of which 4555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 4555 transition count 7977
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 4516 transition count 7977
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 79 place count 4516 transition count 7827
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 379 place count 4366 transition count 7827
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 427 place count 4318 transition count 7759
Iterating global reduction 2 with 48 rules applied. Total rules applied 475 place count 4318 transition count 7759
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 511 place count 4282 transition count 7651
Iterating global reduction 2 with 36 rules applied. Total rules applied 547 place count 4282 transition count 7651
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 609 place count 4251 transition count 7620
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 643 place count 4217 transition count 7586
Iterating global reduction 2 with 34 rules applied. Total rules applied 677 place count 4217 transition count 7586
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 677 place count 4217 transition count 7581
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 687 place count 4212 transition count 7581
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 720 place count 4179 transition count 7482
Iterating global reduction 2 with 33 rules applied. Total rules applied 753 place count 4179 transition count 7482
Applied a total of 753 rules in 2621 ms. Remains 4179 /4556 variables (removed 377) and now considering 7482/8016 (removed 534) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2621 ms. Remains : 4179/4556 places, 7482/8016 transitions.
[2023-03-23 21:00:21] [INFO ] Flatten gal took : 175 ms
[2023-03-23 21:00:21] [INFO ] Flatten gal took : 197 ms
[2023-03-23 21:00:21] [INFO ] Input system was already deterministic with 7482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 4556/4556 places, 8016/8016 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4555 transition count 8016
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 82 place count 4474 transition count 7915
Iterating global reduction 1 with 81 rules applied. Total rules applied 163 place count 4474 transition count 7915
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 232 place count 4405 transition count 7788
Iterating global reduction 1 with 69 rules applied. Total rules applied 301 place count 4405 transition count 7788
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 340 place count 4366 transition count 7671
Iterating global reduction 1 with 39 rules applied. Total rules applied 379 place count 4366 transition count 7671
Applied a total of 379 rules in 1362 ms. Remains 4366 /4556 variables (removed 190) and now considering 7671/8016 (removed 345) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1363 ms. Remains : 4366/4556 places, 7671/8016 transitions.
[2023-03-23 21:00:23] [INFO ] Flatten gal took : 174 ms
[2023-03-23 21:00:23] [INFO ] Flatten gal took : 199 ms
[2023-03-23 21:00:24] [INFO ] Input system was already deterministic with 7671 transitions.
[2023-03-23 21:00:24] [INFO ] Flatten gal took : 199 ms
[2023-03-23 21:00:24] [INFO ] Flatten gal took : 211 ms
[2023-03-23 21:00:24] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-23 21:00:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4556 places, 8016 transitions and 37204 arcs took 44 ms.
Total runtime 166225 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: 4556 NrTr: 8016 NrArc: 37204)
parse formulas
formulas created successfully
place and transition orderings generation:0m 4.038sec
net check time: 0m 0.011sec
init dd package: 0m 2.676sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9729912 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16085432 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
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.335sec
45931 76263 109517 143160 177754 208052 236915 265819 294104 323240 364425 412105 452951
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="MultiCrashLeafsetExtension-PT-S24C03"
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 MultiCrashLeafsetExtension-PT-S24C03, 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 r234-tall-167856420800809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C03.tgz
mv MultiCrashLeafsetExtension-PT-S24C03 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 '
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 ;