Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r074-smll-167814400300450.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 CloudDeployment-PT-7b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400300450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 14:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M 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 CloudDeployment-PT-7b-CTLFireability-00
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-01
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-02
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-03
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-04
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-05
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-06
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-07
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-08
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-09
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-10
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-11
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-12
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-13
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-14
FORMULA_NAME CloudDeployment-PT-7b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678512717902

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=CloudDeployment-PT-7b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 05:32:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 05:32:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:32:02] [INFO ] Load time of PNML (sax parser for PT used): 1535 ms
[2023-03-11 05:32:03] [INFO ] Transformed 2271 places.
[2023-03-11 05:32:03] [INFO ] Transformed 19752 transitions.
[2023-03-11 05:32:03] [INFO ] Found NUPN structural information;
[2023-03-11 05:32:03] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 1952 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 60 out of 2271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 2264 transition count 19752
Discarding 646 places :
Symmetric choice reduction at 1 with 646 rule applications. Total rules 653 place count 1618 transition count 19106
Iterating global reduction 1 with 646 rules applied. Total rules applied 1299 place count 1618 transition count 19106
Discarding 264 places :
Symmetric choice reduction at 1 with 264 rule applications. Total rules 1563 place count 1354 transition count 18842
Iterating global reduction 1 with 264 rules applied. Total rules applied 1827 place count 1354 transition count 18842
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 1869 place count 1354 transition count 18800
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1894 place count 1329 transition count 18775
Iterating global reduction 2 with 25 rules applied. Total rules applied 1919 place count 1329 transition count 18775
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1922 place count 1326 transition count 18772
Iterating global reduction 2 with 3 rules applied. Total rules applied 1925 place count 1326 transition count 18772
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1927 place count 1324 transition count 18770
Iterating global reduction 2 with 2 rules applied. Total rules applied 1929 place count 1324 transition count 18770
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1930 place count 1323 transition count 18769
Iterating global reduction 2 with 1 rules applied. Total rules applied 1931 place count 1323 transition count 18769
Applied a total of 1931 rules in 1939 ms. Remains 1323 /2271 variables (removed 948) and now considering 18769/19752 (removed 983) transitions.
// Phase 1: matrix 18769 rows 1323 cols
[2023-03-11 05:32:06] [INFO ] Computed 22 place invariants in 523 ms
[2023-03-11 05:32:07] [INFO ] Implicit Places using invariants in 1736 ms returned []
Implicit Place search using SMT only with invariants took 1785 ms to find 0 implicit places.
[2023-03-11 05:32:07] [INFO ] Invariant cache hit.
[2023-03-11 05:32:25] [INFO ] Dead Transitions using invariants and state equation in 18412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/2271 places, 18769/19752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22148 ms. Remains : 1323/2271 places, 18769/19752 transitions.
Support contains 60 out of 1323 places after structural reductions.
[2023-03-11 05:32:31] [INFO ] Flatten gal took : 4990 ms
[2023-03-11 05:32:35] [INFO ] Flatten gal took : 4252 ms
[2023-03-11 05:32:43] [INFO ] Input system was already deterministic with 18769 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 1133 ms. (steps per millisecond=8 ) properties (out of 86) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 83) 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 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 83) 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 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 83) seen :0
Interrupted probabilistic random walk after 29154 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 29154 steps, saw 9272 distinct states, run finished after 3003 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 83 properties.
[2023-03-11 05:32:48] [INFO ] Invariant cache hit.
[2023-03-11 05:32:54] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 15 ms returned sat
[2023-03-11 05:32:54] [INFO ] After 3137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:83
[2023-03-11 05:32:57] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 18 ms returned sat
[2023-03-11 05:33:19] [INFO ] After 20125ms SMT Verify possible using state equation in natural domain returned unsat :17 sat :66
[2023-03-11 05:33:20] [INFO ] After 20188ms SMT Verify possible using trap constraints in natural domain returned unsat :17 sat :66
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 05:33:20] [INFO ] After 25196ms SMT Verify possible using all constraints in natural domain returned unsat :17 sat :66
Fused 83 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 121 ms.
Support contains 54 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 18769/18769 transitions.
Graph (trivial) has 1305 edges and 1323 vertex of which 463 / 1323 are part of one of the 51 SCC in 12 ms
Free SCC test removed 412 places
Drop transitions removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Graph (complete) has 4010 edges and 911 vertex of which 910 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.90 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 346 rules applied. Total rules applied 348 place count 910 transition count 17899
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 353 rules applied. Total rules applied 701 place count 570 transition count 17886
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 712 place count 559 transition count 17886
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 712 place count 559 transition count 17799
Deduced a syphon composed of 87 places in 4 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 886 place count 472 transition count 17799
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 887 place count 471 transition count 17798
Iterating global reduction 3 with 1 rules applied. Total rules applied 888 place count 471 transition count 17798
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 3 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 1138 place count 346 transition count 17673
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -292
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1218 place count 306 transition count 17965
Drop transitions removed 13 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1266 place count 306 transition count 17917
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1280 place count 299 transition count 18001
Drop transitions removed 186 transitions
Redundant transition composition rules discarded 186 transitions
Iterating global reduction 4 with 186 rules applied. Total rules applied 1466 place count 299 transition count 17815
Free-agglomeration rule applied 62 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1528 place count 299 transition count 17733
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 95 transitions
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 206 transitions.
Iterating post reduction 4 with 268 rules applied. Total rules applied 1796 place count 237 transition count 17527
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1801 place count 232 transition count 17486
Iterating global reduction 5 with 5 rules applied. Total rules applied 1806 place count 232 transition count 17486
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 5 with 108 rules applied. Total rules applied 1914 place count 232 transition count 17378
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1915 place count 232 transition count 17378
Applied a total of 1915 rules in 3372 ms. Remains 232 /1323 variables (removed 1091) and now considering 17378/18769 (removed 1391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3380 ms. Remains : 232/1323 places, 17378/18769 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 1531 ms. (steps per millisecond=6 ) properties (out of 65) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) 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 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) 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 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) 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 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 64) seen :0
Interrupted probabilistic random walk after 39283 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{22=1}
Probabilistic random walk after 39283 steps, saw 10833 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :1
Running SMT prover for 63 properties.
[2023-03-11 05:33:28] [INFO ] Flow matrix only has 16954 transitions (discarded 424 similar events)
// Phase 1: matrix 16954 rows 232 cols
[2023-03-11 05:33:28] [INFO ] Computed 28 place invariants in 248 ms
[2023-03-11 05:33:31] [INFO ] [Real]Absence check using 0 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-11 05:33:48] [INFO ] After 16772ms SMT Verify possible using state equation in real domain returned unsat :44 sat :2 real:17
[2023-03-11 05:33:48] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-03-11 05:33:50] [INFO ] After 2343ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :44 sat :0 real:19
[2023-03-11 05:33:50] [INFO ] After 20066ms SMT Verify possible using all constraints in real domain returned unsat :44 sat :0 real:19
[2023-03-11 05:33:51] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 20 ms returned sat
[2023-03-11 05:34:04] [INFO ] After 13386ms SMT Verify possible using state equation in natural domain returned unsat :59 sat :4
[2023-03-11 05:34:10] [INFO ] After 6096ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :59 sat :4
[2023-03-11 05:34:16] [INFO ] After 11309ms SMT Verify possible using trap constraints in natural domain returned unsat :59 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 05:34:16] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :59 sat :4
Fused 63 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 32 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 17378/17378 transitions.
Graph (trivial) has 90 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 228 transition count 17366
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 225 transition count 17366
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 225 transition count 17364
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 223 transition count 17364
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 2 with 2 rules applied. Total rules applied 13 place count 222 transition count 17363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 221 transition count 17370
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 221 transition count 17369
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 54 place count 221 transition count 17331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 220 transition count 17338
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 220 transition count 17337
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 66 place count 220 transition count 17328
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 78 place count 220 transition count 17316
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 42 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 141 place count 208 transition count 17265
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 144 place count 205 transition count 17233
Iterating global reduction 5 with 3 rules applied. Total rules applied 147 place count 205 transition count 17233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 205 transition count 17231
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 170 place count 205 transition count 17210
Applied a total of 170 rules in 3775 ms. Remains 205 /232 variables (removed 27) and now considering 17210/17378 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3775 ms. Remains : 205/232 places, 17210/17378 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 1233 ms. (steps per millisecond=8 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:34:21] [INFO ] Flow matrix only has 16809 transitions (discarded 401 similar events)
// Phase 1: matrix 16809 rows 205 cols
[2023-03-11 05:34:21] [INFO ] Computed 29 place invariants in 202 ms
[2023-03-11 05:34:21] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-11 05:34:21] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:34:22] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-11 05:34:33] [INFO ] After 11432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:34:33] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 05:34:37] [INFO ] After 4243ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 05:34:42] [INFO ] After 8510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3790 ms.
[2023-03-11 05:34:45] [INFO ] After 23964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 133 ms.
Support contains 31 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 17210/17210 transitions.
Graph (trivial) has 59 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 203 transition count 17200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 203 transition count 17200
Applied a total of 3 rules in 969 ms. Remains 203 /205 variables (removed 2) and now considering 17200/17210 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 203/205 places, 17200/17210 transitions.
Successfully simplified 76 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA CloudDeployment-PT-7b-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 05:34:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-11 05:34:51] [INFO ] Flatten gal took : 3876 ms
[2023-03-11 05:34:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CloudDeployment-PT-7b-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 05:34:55] [INFO ] Flatten gal took : 3893 ms
[2023-03-11 05:35:00] [INFO ] Input system was already deterministic with 18769 transitions.
Support contains 5 out of 1323 places (down from 9) after GAL structural reductions.
Computed a total of 205 stabilizing places and 17245 stable transitions
Graph (complete) has 4691 edges and 1323 vertex of which 1285 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.154 ms
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 18769/18769 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1322 transition count 18769
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 1304 transition count 2382
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 1304 transition count 2382
Applied a total of 37 rules in 4522 ms. Remains 1304 /1323 variables (removed 19) and now considering 2382/18769 (removed 16387) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4522 ms. Remains : 1304/1323 places, 2382/18769 transitions.
[2023-03-11 05:35:05] [INFO ] Flatten gal took : 78 ms
[2023-03-11 05:35:05] [INFO ] Flatten gal took : 83 ms
[2023-03-11 05:35:05] [INFO ] Input system was already deterministic with 2382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 18769/18769 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1322 transition count 18769
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 1304 transition count 2382
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 1304 transition count 2382
Applied a total of 37 rules in 4730 ms. Remains 1304 /1323 variables (removed 19) and now considering 2382/18769 (removed 16387) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4730 ms. Remains : 1304/1323 places, 2382/18769 transitions.
[2023-03-11 05:35:10] [INFO ] Flatten gal took : 75 ms
[2023-03-11 05:35:10] [INFO ] Flatten gal took : 82 ms
[2023-03-11 05:35:10] [INFO ] Input system was already deterministic with 2382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 18769/18769 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1322 transition count 18769
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 1304 transition count 2382
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 1304 transition count 2382
Applied a total of 37 rules in 4733 ms. Remains 1304 /1323 variables (removed 19) and now considering 2382/18769 (removed 16387) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4734 ms. Remains : 1304/1323 places, 2382/18769 transitions.
[2023-03-11 05:35:15] [INFO ] Flatten gal took : 79 ms
[2023-03-11 05:35:15] [INFO ] Flatten gal took : 82 ms
[2023-03-11 05:35:15] [INFO ] Input system was already deterministic with 2382 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1323/1323 places, 18769/18769 transitions.
Graph (trivial) has 1352 edges and 1323 vertex of which 489 / 1323 are part of one of the 55 SCC in 5 ms
Free SCC test removed 434 places
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Graph (complete) has 4113 edges and 889 vertex of which 851 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.56 ms
Discarding 38 places :
Also discarding 16385 output transitions
Drop transitions removed 16385 transitions
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 350 place count 851 transition count 1540
Reduce places removed 348 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 503 transition count 1537
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 703 place count 501 transition count 1537
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 703 place count 501 transition count 1466
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 845 place count 430 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 846 place count 429 transition count 1465
Iterating global reduction 3 with 1 rules applied. Total rules applied 847 place count 429 transition count 1465
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1089 place count 308 transition count 1344
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 1117 place count 308 transition count 1316
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 14 rules applied. Total rules applied 1131 place count 308 transition count 1302
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1145 place count 294 transition count 1302
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1159 place count 287 transition count 1295
Applied a total of 1159 rules in 530 ms. Remains 287 /1323 variables (removed 1036) and now considering 1295/18769 (removed 17474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 531 ms. Remains : 287/1323 places, 1295/18769 transitions.
[2023-03-11 05:35:16] [INFO ] Flatten gal took : 62 ms
[2023-03-11 05:35:16] [INFO ] Flatten gal took : 69 ms
[2023-03-11 05:35:16] [INFO ] Input system was already deterministic with 1295 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 447742 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447742 steps, saw 67401 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:35:19] [INFO ] Flow matrix only has 1045 transitions (discarded 250 similar events)
// Phase 1: matrix 1045 rows 287 cols
[2023-03-11 05:35:19] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-11 05:35:19] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 05:35:20] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:35:20] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 05:35:20] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:35:21] [INFO ] State equation strengthened by 386 read => feed constraints.
[2023-03-11 05:35:21] [INFO ] After 181ms SMT Verify possible using 386 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:35:21] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-11 05:35:21] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 1295/1295 transitions.
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 287 transition count 1214
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 125 place count 265 transition count 1192
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -259
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 167 place count 244 transition count 1451
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 185 place count 244 transition count 1433
Drop transitions removed 224 transitions
Redundant transition composition rules discarded 224 transitions
Iterating global reduction 2 with 224 rules applied. Total rules applied 409 place count 244 transition count 1209
Free-agglomeration rule applied 72 times with reduction of 30 identical transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 481 place count 244 transition count 1107
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 2 with 320 rules applied. Total rules applied 801 place count 172 transition count 859
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 810 place count 163 transition count 778
Iterating global reduction 3 with 9 rules applied. Total rules applied 819 place count 163 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 821 place count 163 transition count 776
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 822 place count 163 transition count 775
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 823 place count 163 transition count 775
Applied a total of 823 rules in 174 ms. Remains 163 /287 variables (removed 124) and now considering 775/1295 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 163/287 places, 775/1295 transitions.
Incomplete random walk after 1000000 steps, including 12224 resets, run finished after 5214 ms. (steps per millisecond=191 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 642 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4047342 steps, run timeout after 18001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 4047342 steps, saw 510092 distinct states, run finished after 18004 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:35:45] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
// Phase 1: matrix 381 rows 163 cols
[2023-03-11 05:35:45] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-11 05:35:45] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-11 05:35:45] [INFO ] [Real]Absence check using 7 positive and 19 generalized place invariants in 11 ms returned sat
[2023-03-11 05:35:46] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:35:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-11 05:35:46] [INFO ] [Nat]Absence check using 7 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-11 05:35:46] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:35:46] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-11 05:35:46] [INFO ] After 116ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:35:46] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 05:35:46] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 126 ms.
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 775/775 transitions.
Applied a total of 0 rules in 17 ms. Remains 163 /163 variables (removed 0) and now considering 775/775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 163/163 places, 775/775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 775/775 transitions.
Applied a total of 0 rules in 16 ms. Remains 163 /163 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2023-03-11 05:35:46] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:35:46] [INFO ] Invariant cache hit.
[2023-03-11 05:35:47] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-11 05:35:47] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:35:47] [INFO ] Invariant cache hit.
[2023-03-11 05:35:47] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-11 05:35:47] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-03-11 05:35:48] [INFO ] Redundant transitions in 411 ms returned []
[2023-03-11 05:35:48] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:35:48] [INFO ] Invariant cache hit.
[2023-03-11 05:35:48] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1877 ms. Remains : 163/163 places, 775/775 transitions.
Incomplete random walk after 1000000 steps, including 12270 resets, run finished after 5200 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 640 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4052615 steps, run timeout after 18001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 4052615 steps, saw 512070 distinct states, run finished after 18001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 05:36:12] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:36:12] [INFO ] Invariant cache hit.
[2023-03-11 05:36:12] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-11 05:36:12] [INFO ] [Real]Absence check using 7 positive and 19 generalized place invariants in 11 ms returned sat
[2023-03-11 05:36:13] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:36:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-11 05:36:13] [INFO ] [Nat]Absence check using 7 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-11 05:36:13] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:36:13] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-11 05:36:13] [INFO ] After 116ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:36:13] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-11 05:36:13] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 122 ms.
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 775/775 transitions.
Applied a total of 0 rules in 17 ms. Remains 163 /163 variables (removed 0) and now considering 775/775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 163/163 places, 775/775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 775/775 transitions.
Applied a total of 0 rules in 16 ms. Remains 163 /163 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2023-03-11 05:36:13] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:36:13] [INFO ] Invariant cache hit.
[2023-03-11 05:36:14] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-11 05:36:14] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:36:14] [INFO ] Invariant cache hit.
[2023-03-11 05:36:14] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-11 05:36:14] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2023-03-11 05:36:15] [INFO ] Redundant transitions in 434 ms returned []
[2023-03-11 05:36:15] [INFO ] Flow matrix only has 381 transitions (discarded 394 similar events)
[2023-03-11 05:36:15] [INFO ] Invariant cache hit.
[2023-03-11 05:36:15] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1968 ms. Remains : 163/163 places, 775/775 transitions.
Graph (trivial) has 159 edges and 163 vertex of which 48 / 163 are part of one of the 6 SCC in 8 ms
Free SCC test removed 42 places
Drop transitions removed 66 transitions
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 460 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 110 transition count 294
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 55 place count 89 transition count 293
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 88 transition count 292
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 57 place count 88 transition count 280
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 81 place count 76 transition count 280
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 72 transition count 276
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 72 transition count 276
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 68 transition count 248
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 68 transition count 248
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 157 place count 68 transition count 188
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 175 place count 59 transition count 179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 187 place count 59 transition count 167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 58 transition count 166
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 58 transition count 166
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 57 transition count 159
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 57 transition count 159
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 206 place count 57 transition count 144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 220 place count 50 transition count 201
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 6 with 79 rules applied. Total rules applied 299 place count 50 transition count 122
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 311 place count 44 transition count 116
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 316 place count 39 transition count 71
Iterating global reduction 6 with 5 rules applied. Total rules applied 321 place count 39 transition count 71
Applied a total of 321 rules in 39 ms. Remains 39 /163 variables (removed 124) and now considering 71/775 (removed 704) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 39 cols
[2023-03-11 05:36:15] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 05:36:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 05:36:15] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 05:36:16] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:36:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 05:36:16] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 05:36:16] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:36:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 05:36:16] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:36:16] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 05:36:16] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 05:36:20] [INFO ] Flatten gal took : 4285 ms
[2023-03-11 05:36:24] [INFO ] Flatten gal took : 3983 ms
[2023-03-11 05:36:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-11 05:36:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1323 places, 18769 transitions and 387585 arcs took 213 ms.
Total runtime 263886 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: 1323 NrTr: 18769 NrArc: 387585)

parse formulas
formulas created successfully
place and transition orderings generation:1m 4.157sec

net check time: 0m 0.137sec

init dd package: 0m 2.913sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8531592 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16030892 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 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 2.269sec

720455 754717 900383

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="CloudDeployment-PT-7b"
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 CloudDeployment-PT-7b, 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 r074-smll-167814400300450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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