Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K Apr 13 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K May 18 16:42 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-V20P10N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717217841310

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-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:57:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:57:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:57:22] [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.
[2024-06-01 04:57:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:57:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 570 ms
[2024-06-01 04:57:23] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-06-01 04:57:23] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2024-06-01 04:57:23] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-10 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.5 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.
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
RANDOM walk for 40000 steps (8 resets) in 1888 ms. (21 steps per ms) remains 29/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 105 ms. (37 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 106 ms. (37 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 04:57:24] [INFO ] Computed 4 invariants in 3 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 19 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Real declared 12/22 variables, and 4 constraints, problems are : Problem set: 27 solved, 0 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 27 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 27 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:24] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-06-01 04:57:24] [INFO ] Flatten gal took : 15 ms
[2024-06-01 04:57:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:57:24] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
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 [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 04:57:24] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 44 ms.
[2024-06-01 04:57:24] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 15 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-06-01 04:57:24] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-06-01 04:57:24] [INFO ] Computed 7 invariants in 12 ms
[2024-06-01 04:57:24] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-06-01 04:57:30] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 9 ms to minimize.
[2024-06-01 04:57:33] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-06-01 04:57:35] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
[2024-06-01 04:57:40] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/11 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 78/248 variables, and 11 constraints, problems are : Problem set: 40 solved, 925 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/78 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 40 solved, 925 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/11 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 6 (OVERLAPS) 170/248 variables, 78/89 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 42/131 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 923/1054 constraints. Problems are: Problem set: 42 solved, 923 unsolved
[2024-06-01 04:58:06] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 248/248 variables, and 1055 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 923/965 constraints, Known Traps: 5/5 constraints]
After SMT, in 43750ms problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43780ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-06-01 04:58:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 78 cols
[2024-06-01 04:58:08] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 04:58:08] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 04:58:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:08] [INFO ] Invariant cache hit.
[2024-06-01 04:58:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 04:58:09] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/78 places, 926/968 transitions.
Applied a total of 0 rules in 12 ms. Remains 78 /78 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44354 ms. Remains : 78/78 places, 926/968 transitions.
Support contains 15 out of 78 places after structural reductions.
[2024-06-01 04:58:09] [INFO ] Flatten gal took : 89 ms
[2024-06-01 04:58:09] [INFO ] Flatten gal took : 94 ms
[2024-06-01 04:58:09] [INFO ] Input system was already deterministic with 926 transitions.
RANDOM walk for 40000 steps (228 resets) in 2006 ms. (19 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40003 steps (80 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (108 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (81 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (76 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (81 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (86 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (97 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
[2024-06-01 04:58:10] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-06-01 04:58:10] [INFO ] Invariant cache hit.
[2024-06-01 04:58:10] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 15/244 variables, and 4 constraints, problems are : Problem set: 8 solved, 0 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/78 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 6 simplifications.
[2024-06-01 04:58:11] [INFO ] Flatten gal took : 44 ms
[2024-06-01 04:58:11] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:58:11] [INFO ] Input system was already deterministic with 926 transitions.
FORMULA BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 82 stable transitions
Graph (complete) has 1639 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 15 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 04:58:11] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-06-01 04:58:11] [INFO ] Computed 7 invariants in 5 ms
[2024-06-01 04:58:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:58:16] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:58:27] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42890ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42899ms
Finished structural reductions in LTL mode , in 1 iterations and 42917 ms. Remains : 75/78 places, 925/926 transitions.
[2024-06-01 04:58:54] [INFO ] Flatten gal took : 57 ms
[2024-06-01 04:58:54] [INFO ] Flatten gal took : 44 ms
[2024-06-01 04:58:54] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 15 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 04:58:54] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 04:58:54] [INFO ] Invariant cache hit.
[2024-06-01 04:58:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:59:00] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:59:11] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 43646ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43660ms
Finished structural reductions in LTL mode , in 1 iterations and 43679 ms. Remains : 75/78 places, 925/926 transitions.
[2024-06-01 04:59:38] [INFO ] Flatten gal took : 51 ms
[2024-06-01 04:59:38] [INFO ] Flatten gal took : 44 ms
[2024-06-01 04:59:38] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 12 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 04:59:38] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-06-01 04:59:38] [INFO ] Invariant cache hit.
[2024-06-01 04:59:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:59:43] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 04:59:55] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 43556ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43569ms
Finished structural reductions in LTL mode , in 1 iterations and 43584 ms. Remains : 75/78 places, 925/926 transitions.
[2024-06-01 05:00:21] [INFO ] Flatten gal took : 26 ms
[2024-06-01 05:00:21] [INFO ] Flatten gal took : 27 ms
[2024-06-01 05:00:21] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Applied a total of 2 rules in 5 ms. Remains 76 /78 variables (removed 2) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:00:21] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-06-01 05:00:21] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:00:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:00:27] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/242 variables, and 124 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 923/1047 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:01:01] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-06-01 05:01:03] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1049 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 3/3 constraints]
After SMT, in 43061ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43071ms
Finished structural reductions in LTL mode , in 1 iterations and 43079 ms. Remains : 76/78 places, 926/926 transitions.
[2024-06-01 05:01:05] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:01:05] [INFO ] Flatten gal took : 42 ms
[2024-06-01 05:01:05] [INFO ] Input system was already deterministic with 926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 926
Applied a total of 1 rules in 8 ms. Remains 77 /78 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-06-01 05:01:05] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-06-01 05:01:05] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:01:10] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-06-01 05:01:21] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/243 variables, and 10 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/77 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/243 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 923/1050 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 1050 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 43476ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43491ms
Finished structural reductions in LTL mode , in 1 iterations and 43503 ms. Remains : 77/78 places, 926/926 transitions.
[2024-06-01 05:01:48] [INFO ] Flatten gal took : 22 ms
[2024-06-01 05:01:48] [INFO ] Flatten gal took : 25 ms
[2024-06-01 05:01:48] [INFO ] Input system was already deterministic with 926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 12 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-06-01 05:01:48] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-06-01 05:01:48] [INFO ] Computed 7 invariants in 5 ms
[2024-06-01 05:01:48] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:01:53] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-06-01 05:02:05] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 43047ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43074ms
Finished structural reductions in LTL mode , in 1 iterations and 43102 ms. Remains : 75/78 places, 925/926 transitions.
[2024-06-01 05:02:32] [INFO ] Flatten gal took : 33 ms
[2024-06-01 05:02:32] [INFO ] Flatten gal took : 35 ms
[2024-06-01 05:02:32] [INFO ] Input system was already deterministic with 925 transitions.
[2024-06-01 05:02:32] [INFO ] Flatten gal took : 33 ms
[2024-06-01 05:02:32] [INFO ] Flatten gal took : 32 ms
[2024-06-01 05:02:32] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 05:02:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 926 transitions and 7022 arcs took 14 ms.
Total runtime 309618 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-02
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-11
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-12
Could not compute solution for formula : BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-13

BK_STOP 1717218152578

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/647/ctl_0_
ctl formula name BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/647/ctl_1_
ctl formula name BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/647/ctl_2_
ctl formula name BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/647/ctl_3_
ctl formula name BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/647/ctl_4_
ctl formula name BridgeAndVehicles-COL-V20P10N20-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/647/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-V20P10N20"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-COL-V20P10N20, 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 r472-tajo-171620398600025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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