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

About the Execution of LTSMin+red for BridgeAndVehicles-COL-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15985.680 2876975.00 11460682.00 133.80 TTTFFTFFFFTTTTFT 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.r041-tajo-167813694100041.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 ltsminxred
Input is BridgeAndVehicles-COL-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694100041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.1K Feb 25 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 12:06 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 3.8K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:35 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 39K 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-V20P20N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678602350206

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 06:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:25:52] [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-12 06:25:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 06:25:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 578 ms
[2023-03-12 06:25:53] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
[2023-03-12 06:25:53] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 17 ms.
[2023-03-12 06:25:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
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.11 ms
Remains 16 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.
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.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 80) seen :27
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 51) 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 51) 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 51) 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 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1003 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1003 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=167 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) 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 50) 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 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 06:25:54] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 06:25:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:25:54] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :36 sat :0 real:14
[2023-03-12 06:25:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:25:54] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :45 sat :5
[2023-03-12 06:25:54] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :45 sat :5
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-12 06:25:54] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :45 sat :5
Fused 50 Parikh solutions to 4 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 5 properties in 9 ms.
Successfully simplified 45 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 06:25:54] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-12 06:25:55] [INFO ] Flatten gal took : 52 ms
[2023-03-12 06:25:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 06:25:55] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] 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-12 06:25:55] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 61 ms.
[2023-03-12 06:25:55] [INFO ] Unfolded 9 HLPN properties in 13 ms.
Support contains 15 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 33 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:25:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-12 06:25:55] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-12 06:25:56] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
[2023-03-12 06:25:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:25:56] [INFO ] Invariant cache hit.
[2023-03-12 06:25:56] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-12 06:25:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:25:56] [INFO ] Invariant cache hit.
[2023-03-12 06:25:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:25:56] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-12 06:25:56] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:25:56] [INFO ] Invariant cache hit.
[2023-03-12 06:25:57] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1879 ms. Remains : 68/68 places, 548/548 transitions.
Support contains 15 out of 68 places after structural reductions.
[2023-03-12 06:25:57] [INFO ] Flatten gal took : 65 ms
[2023-03-12 06:25:57] [INFO ] Flatten gal took : 49 ms
[2023-03-12 06:25:57] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 46) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-03-12 06:25:58] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:25:58] [INFO ] Invariant cache hit.
[2023-03-12 06:25:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 06:25:58] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:9
[2023-03-12 06:25:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 06:25:58] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :24 sat :2
[2023-03-12 06:25:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:25:58] [INFO ] After 41ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :24 sat :2
[2023-03-12 06:25:58] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 06:25:58] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :2
Fused 26 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 81 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:25:58] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 06:25:59] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-12 06:25:59] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 465259 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465259 steps, saw 116860 distinct states, run finished after 3002 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:26:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:26:02] [INFO ] Invariant cache hit.
[2023-03-12 06:26:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:26:02] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:26:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:26:02] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:26:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:26:02] [INFO ] After 54ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:26:02] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-12 06:26:03] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 47 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 40 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:26:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:26:03] [INFO ] Invariant cache hit.
[2023-03-12 06:26:03] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-12 06:26:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:26:03] [INFO ] Invariant cache hit.
[2023-03-12 06:26:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:26:03] [INFO ] Implicit Places using invariants and state equation in 338 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 488 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 552 ms. Remains : 64/66 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 641720 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641720 steps, saw 157228 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:26:06] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2023-03-12 06:26:06] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:26:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:26:06] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:26:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:26:07] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:26:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:26:07] [INFO ] After 26ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:26:07] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-12 06:26:07] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:26:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:26:07] [INFO ] Invariant cache hit.
[2023-03-12 06:26:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 06:26:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:26:07] [INFO ] Invariant cache hit.
[2023-03-12 06:26:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 06:26:07] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-12 06:26:07] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 06:26:07] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2023-03-12 06:26:07] [INFO ] Invariant cache hit.
[2023-03-12 06:26:07] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 420 place count 64 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 422 place count 62 transition count 128
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 424 place count 62 transition count 128
Applied a total of 424 rules in 11 ms. Remains 62 /64 variables (removed 2) and now considering 128/548 (removed 420) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 128 rows 62 cols
[2023-03-12 06:26:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:26:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:26:07] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:26:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:26:08] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:26:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 06:26:08] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:26:08] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 06:26:08] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 24 atomic propositions for a total of 9 simplifications.
[2023-03-12 06:26:08] [INFO ] Flatten gal took : 28 ms
[2023-03-12 06:26:08] [INFO ] Flatten gal took : 27 ms
[2023-03-12 06:26:08] [INFO ] Input system was already deterministic with 548 transitions.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 10 place count 61 transition count 544
Applied a total of 10 rules in 76 ms. Remains 61 /68 variables (removed 7) and now considering 544/548 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 61/68 places, 544/548 transitions.
[2023-03-12 06:26:08] [INFO ] Flatten gal took : 18 ms
[2023-03-12 06:26:08] [INFO ] Flatten gal took : 20 ms
[2023-03-12 06:26:08] [INFO ] Input system was already deterministic with 544 transitions.
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 4 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:26:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-12 06:26:08] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 06:26:08] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 67/68 places, 548/548 transitions.
[2023-03-12 06:26:08] [INFO ] Flatten gal took : 36 ms
[2023-03-12 06:26:09] [INFO ] Flatten gal took : 34 ms
[2023-03-12 06:26:09] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 4 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:26:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2023-03-12 06:26:09] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:26:09] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 66/68 places, 548/548 transitions.
[2023-03-12 06:26:09] [INFO ] Flatten gal took : 47 ms
[2023-03-12 06:26:09] [INFO ] Flatten gal took : 36 ms
[2023-03-12 06:26:09] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:26:09] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2023-03-12 06:26:09] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 06:26:10] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 68/68 places, 548/548 transitions.
[2023-03-12 06:26:10] [INFO ] Flatten gal took : 45 ms
[2023-03-12 06:26:10] [INFO ] Flatten gal took : 45 ms
[2023-03-12 06:26:10] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 61 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2023-03-12 06:26:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2023-03-12 06:26:10] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-12 06:26:10] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 329 ms. Remains : 67/68 places, 548/548 transitions.
[2023-03-12 06:26:10] [INFO ] Flatten gal took : 22 ms
[2023-03-12 06:26:10] [INFO ] Flatten gal took : 24 ms
[2023-03-12 06:26:10] [INFO ] Input system was already deterministic with 548 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 6 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 06:26:10] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2023-03-12 06:26:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:26:10] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-12 06:26:10] [INFO ] Flatten gal took : 17 ms
[2023-03-12 06:26:10] [INFO ] Flatten gal took : 17 ms
[2023-03-12 06:26:11] [INFO ] Input system was already deterministic with 547 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 5 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 06:26:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 06:26:11] [INFO ] Invariant cache hit.
[2023-03-12 06:26:11] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 13 ms
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 14 ms
[2023-03-12 06:26:11] [INFO ] Input system was already deterministic with 547 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 6 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2023-03-12 06:26:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2023-03-12 06:26:11] [INFO ] Invariant cache hit.
[2023-03-12 06:26:11] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 65/68 places, 547/548 transitions.
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 13 ms
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 15 ms
[2023-03-12 06:26:11] [INFO ] Input system was already deterministic with 547 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 547
Applied a total of 3 rules in 32 ms. Remains 66 /68 variables (removed 2) and now considering 547/548 (removed 1) transitions.
[2023-03-12 06:26:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 66 cols
[2023-03-12 06:26:11] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 06:26:11] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 230 ms. Remains : 66/68 places, 547/548 transitions.
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 13 ms
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 15 ms
[2023-03-12 06:26:11] [INFO ] Input system was already deterministic with 547 transitions.
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 14 ms
[2023-03-12 06:26:11] [INFO ] Flatten gal took : 14 ms
[2023-03-12 06:26:11] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-12 06:26:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 548 transitions and 4070 arcs took 5 ms.
Total runtime 19383 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/580/ctl_0_ --ctl=/tmp/580/ctl_1_ --ctl=/tmp/580/ctl_2_ --ctl=/tmp/580/ctl_3_ --ctl=/tmp/580/ctl_4_ --ctl=/tmp/580/ctl_5_ --ctl=/tmp/580/ctl_6_ --ctl=/tmp/580/ctl_7_ --mu-par --mu-opt
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678605227181

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-02
ctl formula formula --ctl=/tmp/580/ctl_0_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-03
ctl formula formula --ctl=/tmp/580/ctl_1_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-07
ctl formula formula --ctl=/tmp/580/ctl_2_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-08
ctl formula formula --ctl=/tmp/580/ctl_3_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10
ctl formula formula --ctl=/tmp/580/ctl_4_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11
ctl formula formula --ctl=/tmp/580/ctl_5_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13
ctl formula formula --ctl=/tmp/580/ctl_6_
ctl formula name BridgeAndVehicles-COL-V20P20N10-CTLCardinality-15
ctl formula formula --ctl=/tmp/580/ctl_7_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 68 places, 548 transitions and 4070 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 548->508 groups
pnml2lts-sym: Regrouping took 0.130 real 0.130 user 0.000 sys
pnml2lts-sym: state vector length is 68; there are 508 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 161186480 group checks and 0 next state calls
pnml2lts-sym: reachability took 1192.870 real 4755.700 user 8.390 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.100 real 0.400 user 0.000 sys
pnml2lts-sym: state space has 6732570 states, 1327167 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/580/ctl_0_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/580/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/580/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/580/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/580/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/580/ctl_7_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/580/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/580/ctl_1_ does not hold for the initial state
pnml2lts-sym: group_next: 9270 nodes total
pnml2lts-sym: group_explored: 33710 nodes, 49402 short vectors total
pnml2lts-sym: max token count: 20

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-V20P20N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P20N10, 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 r041-tajo-167813694100041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N10.tgz
mv BridgeAndVehicles-COL-V20P20N10 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 ;