fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695300113
Last Updated
May 14, 2023

About the Execution of Marcie+red for BridgeAndVehicles-COL-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11928.907 3600000.00 3656809.00 2399.40 FFT?TF??TF?TT?T? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.8K Feb 25 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 45K 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 BridgeAndVehicles-COL-V80P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678693240912

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:40:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 07:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:40:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 07:40:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 07:40:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2023-03-13 07:40:43] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
[2023-03-13 07:40:43] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2023-03-13 07:40:43] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 75) seen :34
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) 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 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) 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 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 40) seen :0
Running SMT prover for 40 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-13 07:40:44] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 07:40:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 07:40:44] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :19 sat :0 real:21
[2023-03-13 07:40:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 07:40:45] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :35 sat :5
[2023-03-13 07:40:45] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :35 sat :5
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-13 07:40:45] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :35 sat :5
Fused 40 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 24 ms.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (complete) has 20 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 6 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 5 transition count 4
Applied a total of 12 rules in 13 ms. Remains 5 /12 variables (removed 7) and now considering 4/10 (removed 6) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-13 07:40:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-13 07:40:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 5/12 places, 4/10 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Successfully simplified 35 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:40:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-13 07:40:45] [INFO ] Flatten gal took : 32 ms
[2023-03-13 07:40:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:40:45] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-13 07:40:45] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 146 ms.
[2023-03-13 07:40:45] [INFO ] Unfolded 8 HLPN properties in 16 ms.
Support contains 15 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 101 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 07:40:45] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-13 07:40:45] [INFO ] Computed 7 place invariants in 26 ms
[2023-03-13 07:40:47] [INFO ] Dead Transitions using invariants and state equation in 1346 ms found 0 transitions.
[2023-03-13 07:40:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 07:40:47] [INFO ] Invariant cache hit.
[2023-03-13 07:40:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-13 07:40:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 07:40:47] [INFO ] Invariant cache hit.
[2023-03-13 07:40:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 07:40:48] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
[2023-03-13 07:40:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 07:40:48] [INFO ] Invariant cache hit.
[2023-03-13 07:40:49] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3528 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 15 out of 188 places after structural reductions.
[2023-03-13 07:40:49] [INFO ] Flatten gal took : 262 ms
[2023-03-13 07:40:49] [INFO ] Flatten gal took : 205 ms
[2023-03-13 07:40:50] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 41) seen :20
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 07:40:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2023-03-13 07:40:50] [INFO ] Invariant cache hit.
[2023-03-13 07:40:51] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 07:40:51] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:5
[2023-03-13 07:40:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 07:40:51] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :19 sat :1
[2023-03-13 07:40:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 07:40:51] [INFO ] After 89ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :19 sat :1
[2023-03-13 07:40:51] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :19 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 07:40:51] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :1
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 408 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:40:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 07:40:52] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-13 07:40:53] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1220 ms. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278620 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278620 steps, saw 83734 distinct states, run finished after 3003 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 07:40:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:40:56] [INFO ] Invariant cache hit.
[2023-03-13 07:40:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-13 07:40:56] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:40:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 07:40:56] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:40:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 07:40:56] [INFO ] After 79ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:40:56] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-13 07:40:56] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 212 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 603 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 07:40:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:40:57] [INFO ] Invariant cache hit.
[2023-03-13 07:40:58] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-13 07:40:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:40:58] [INFO ] Invariant cache hit.
[2023-03-13 07:40:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 07:40:59] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2017 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 346 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2968 ms. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 348872 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348872 steps, saw 104447 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 07:41:03] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2023-03-13 07:41:03] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 07:41:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 07:41:03] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:41:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 07:41:03] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:41:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 07:41:03] [INFO ] After 69ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:41:03] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-13 07:41:03] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 222 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 165 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2023-03-13 07:41:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:41:04] [INFO ] Invariant cache hit.
[2023-03-13 07:41:04] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-13 07:41:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:41:04] [INFO ] Invariant cache hit.
[2023-03-13 07:41:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-13 07:41:05] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2023-03-13 07:41:05] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-13 07:41:05] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:41:05] [INFO ] Invariant cache hit.
[2023-03-13 07:41:06] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2248 ms. Remains : 183/183 places, 2107/2107 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 181 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 179 transition count 365
Applied a total of 1746 rules in 17 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 365 rows 179 cols
[2023-03-13 07:41:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 07:41:06] [INFO ] [Real]Absence check using 5 positive place invariants in 24 ms returned sat
[2023-03-13 07:41:06] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:41:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 07:41:06] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:41:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 07:41:06] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:41:06] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-13 07:41:06] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 19 atomic propositions for a total of 8 simplifications.
[2023-03-13 07:41:06] [INFO ] Flatten gal took : 121 ms
[2023-03-13 07:41:06] [INFO ] Flatten gal took : 71 ms
[2023-03-13 07:41:07] [INFO ] Input system was already deterministic with 2108 transitions.
Support contains 12 out of 188 places (down from 13) after GAL structural reductions.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 338 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:41:07] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-13 07:41:07] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-13 07:41:08] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 975 ms. Remains : 186/188 places, 2107/2108 transitions.
[2023-03-13 07:41:08] [INFO ] Flatten gal took : 48 ms
[2023-03-13 07:41:08] [INFO ] Flatten gal took : 47 ms
[2023-03-13 07:41:08] [INFO ] Input system was already deterministic with 2107 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 44 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:41:08] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 07:41:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 07:41:09] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 185/188 places, 2107/2108 transitions.
[2023-03-13 07:41:09] [INFO ] Flatten gal took : 44 ms
[2023-03-13 07:41:09] [INFO ] Flatten gal took : 65 ms
[2023-03-13 07:41:09] [INFO ] Input system was already deterministic with 2107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 287 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:41:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2023-03-13 07:41:09] [INFO ] Invariant cache hit.
[2023-03-13 07:41:10] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 945 ms. Remains : 185/188 places, 2107/2108 transitions.
[2023-03-13 07:41:10] [INFO ] Flatten gal took : 41 ms
[2023-03-13 07:41:10] [INFO ] Flatten gal took : 46 ms
[2023-03-13 07:41:10] [INFO ] Input system was already deterministic with 2107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 07:41:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2023-03-13 07:41:10] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 07:41:11] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 188/188 places, 2108/2108 transitions.
[2023-03-13 07:41:11] [INFO ] Flatten gal took : 64 ms
[2023-03-13 07:41:11] [INFO ] Flatten gal took : 48 ms
[2023-03-13 07:41:11] [INFO ] Input system was already deterministic with 2108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 46 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:41:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 07:41:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 07:41:12] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 185/188 places, 2107/2108 transitions.
[2023-03-13 07:41:12] [INFO ] Flatten gal took : 85 ms
[2023-03-13 07:41:12] [INFO ] Flatten gal took : 44 ms
[2023-03-13 07:41:12] [INFO ] Input system was already deterministic with 2107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 180 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:41:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2023-03-13 07:41:12] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-13 07:41:13] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1045 ms. Remains : 186/188 places, 2107/2108 transitions.
[2023-03-13 07:41:13] [INFO ] Flatten gal took : 66 ms
[2023-03-13 07:41:13] [INFO ] Flatten gal took : 45 ms
[2023-03-13 07:41:13] [INFO ] Input system was already deterministic with 2107 transitions.
Finished random walk after 413 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=82 )
FORMULA BridgeAndVehicles-COL-V80P20N10-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 173 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 07:41:13] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2023-03-13 07:41:13] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-13 07:41:14] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1154 ms. Remains : 187/188 places, 2108/2108 transitions.
[2023-03-13 07:41:14] [INFO ] Flatten gal took : 40 ms
[2023-03-13 07:41:14] [INFO ] Flatten gal took : 44 ms
[2023-03-13 07:41:15] [INFO ] Input system was already deterministic with 2108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 44 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2023-03-13 07:41:15] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2023-03-13 07:41:15] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-13 07:41:15] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 185/188 places, 2107/2108 transitions.
[2023-03-13 07:41:15] [INFO ] Flatten gal took : 39 ms
[2023-03-13 07:41:15] [INFO ] Flatten gal took : 56 ms
[2023-03-13 07:41:15] [INFO ] Input system was already deterministic with 2107 transitions.
[2023-03-13 07:41:16] [INFO ] Flatten gal took : 74 ms
[2023-03-13 07:41:16] [INFO ] Flatten gal took : 58 ms
[2023-03-13 07:41:16] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 07:41:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 2108 transitions and 15950 arcs took 27 ms.
Total runtime 32940 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 188 NrTr: 2108 NrArc: 15950)

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

net check time: 0m 0.001sec

init dd package: 0m 3.008sec


before gc: list nodes free: 2318696

after gc: idd nodes used:24263861, unused:39736139; list nodes free:238985797

before gc: list nodes free: 527750

after gc: idd nodes used:35060020, unused:28939980; list nodes free:187282367
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4211924 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16093900 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

1182289 3761818 6885911 11050215 13483785 14737770 18029888 19724365 21957112 24574684 28449317 32045692 32879040 35069018 37122692 38186636 38557836 39197326

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="BridgeAndVehicles-COL-V80P20N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is BridgeAndVehicles-COL-V80P20N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695300113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;