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-171620398700057.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-V20P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398700057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Apr 13 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 13 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 02:26 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.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 03:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 03:54 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 41K 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-V20P20N50-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218069426

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-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:01:10] [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 05:01:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:01:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2024-06-01 05:01:11] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
[2024-06-01 05:01:11] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-06-01 05:01:11] [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.4 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
RANDOM walk for 40000 steps (8 resets) in 2300 ms. (17 steps per ms) remains 37/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:01:12] [INFO ] Computed 4 invariants in 3 ms
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 31 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 31 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 31 solved, 3 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 3/19 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 31 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 19 constraints, problems are : Problem set: 31 solved, 3 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 3/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 31 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 79 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=39 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:12] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 05:01:12] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:01:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:12] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] 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 05:01:12] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 55 ms.
[2024-06-01 05:01:12] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 15 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 40 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 05:01:13] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:01:13] [INFO ] Computed 7 invariants in 14 ms
[2024-06-01 05:01:13] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:01:36] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:02:05] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1494 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 7 solved, 2218 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 56624ms problems are : Problem set: 7 solved, 2218 unsolved
Search for dead transitions found 7 dead transitions in 56683ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 7 transitions.
[2024-06-01 05:02:09] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:02:09] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 05:02:10] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-01 05:02:10] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
[2024-06-01 05:02:10] [INFO ] Invariant cache hit.
[2024-06-01 05:02:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-01 05:02:10] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2221/2228 transitions.
Applied a total of 0 rules in 18 ms. Remains 108 /108 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57864 ms. Remains : 108/108 places, 2221/2228 transitions.
Support contains 15 out of 108 places after structural reductions.
[2024-06-01 05:02:11] [INFO ] Flatten gal took : 185 ms
[2024-06-01 05:02:11] [INFO ] Flatten gal took : 166 ms
[2024-06-01 05:02:11] [INFO ] Input system was already deterministic with 2221 transitions.
RANDOM walk for 40000 steps (228 resets) in 2333 ms. (17 steps per ms) remains 16/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
[2024-06-01 05:02:12] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
[2024-06-01 05:02:12] [INFO ] Invariant cache hit.
[2024-06-01 05:02:12] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 15/398 variables, and 4 constraints, problems are : Problem set: 14 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 4/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 9 simplifications.
[2024-06-01 05:02:12] [INFO ] Flatten gal took : 90 ms
[2024-06-01 05:02:12] [INFO ] Flatten gal took : 85 ms
[2024-06-01 05:02:13] [INFO ] Input system was already deterministic with 2221 transitions.
Support contains 11 out of 108 places (down from 12) after GAL structural reductions.
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3183 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2220
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2220
Applied a total of 4 rules in 33 ms. Remains 105 /108 variables (removed 3) and now considering 2220/2221 (removed 1) transitions.
Running 2217 sub problems to find dead transitions.
[2024-06-01 05:02:13] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-06-01 05:02:13] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 05:02:13] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 05:02:34] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 05:03:06] [INFO ] Deduced a trap composed of 55 places in 250 ms of which 3 ms to minimize.
Problem TDEAD1537 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1690 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 7 constraints, problems are : Problem set: 4 solved, 2213 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 2/2 constraints]
After SMT, in 55795ms problems are : Problem set: 4 solved, 2213 unsolved
Search for dead transitions found 4 dead transitions in 55819ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 2216/2221 transitions.
Applied a total of 0 rules in 17 ms. Remains 105 /105 variables (removed 0) and now considering 2216/2216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55879 ms. Remains : 105/108 places, 2216/2221 transitions.
[2024-06-01 05:03:09] [INFO ] Flatten gal took : 69 ms
[2024-06-01 05:03:09] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:03:09] [INFO ] Input system was already deterministic with 2216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2220
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2220
Applied a total of 4 rules in 17 ms. Remains 105 /108 variables (removed 3) and now considering 2220/2221 (removed 1) transitions.
Running 2217 sub problems to find dead transitions.
[2024-06-01 05:03:09] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
[2024-06-01 05:03:09] [INFO ] Invariant cache hit.
[2024-06-01 05:03:09] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 05:03:33] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 57413ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 57436ms
Finished structural reductions in LTL mode , in 1 iterations and 57460 ms. Remains : 105/108 places, 2220/2221 transitions.
[2024-06-01 05:04:06] [INFO ] Flatten gal took : 56 ms
[2024-06-01 05:04:06] [INFO ] Flatten gal took : 67 ms
[2024-06-01 05:04:07] [INFO ] Input system was already deterministic with 2220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2221
Applied a total of 1 rules in 13 ms. Remains 107 /108 variables (removed 1) and now considering 2221/2221 (removed 0) transitions.
Running 2218 sub problems to find dead transitions.
[2024-06-01 05:04:07] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-06-01 05:04:07] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 05:04:07] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-06-01 05:04:32] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-06-01 05:05:05] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 1 ms to minimize.
Problem TDEAD1538 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 7 constraints, problems are : Problem set: 1 solved, 2217 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 2/2 constraints]
After SMT, in 59364ms problems are : Problem set: 1 solved, 2217 unsolved
Search for dead transitions found 1 dead transitions in 59396ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 2220/2221 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59426 ms. Remains : 107/108 places, 2220/2221 transitions.
[2024-06-01 05:05:06] [INFO ] Flatten gal took : 112 ms
[2024-06-01 05:05:06] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:05:06] [INFO ] Input system was already deterministic with 2220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Graph (complete) has 3183 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 2220
Applied a total of 3 rules in 455 ms. Remains 106 /108 variables (removed 2) and now considering 2220/2221 (removed 1) transitions.
Running 2217 sub problems to find dead transitions.
[2024-06-01 05:05:07] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:05:07] [INFO ] Computed 6 invariants in 10 ms
[2024-06-01 05:05:07] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 05:05:29] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 56580ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 56607ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 57067 ms. Remains : 106/108 places, 2220/2221 transitions.
[2024-06-01 05:06:03] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:06:04] [INFO ] Flatten gal took : 69 ms
[2024-06-01 05:06:04] [INFO ] Input system was already deterministic with 2220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Running 2218 sub problems to find dead transitions.
[2024-06-01 05:06:04] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:06:04] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:06:04] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-06-01 05:06:25] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-06-01 05:06:59] [INFO ] Deduced a trap composed of 55 places in 214 ms of which 1 ms to minimize.
Problem TDEAD1538 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 1 solved, 2217 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 2/2 constraints]
After SMT, in 55945ms problems are : Problem set: 1 solved, 2217 unsolved
Search for dead transitions found 1 dead transitions in 55971ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2220/2221 transitions.
Applied a total of 0 rules in 14 ms. Remains 108 /108 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56000 ms. Remains : 108/108 places, 2220/2221 transitions.
[2024-06-01 05:07:00] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:07:00] [INFO ] Flatten gal took : 69 ms
[2024-06-01 05:07:00] [INFO ] Input system was already deterministic with 2220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Graph (complete) has 3183 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 105 transition count 2220
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 101 transition count 2217
Applied a total of 10 rules in 435 ms. Remains 101 /108 variables (removed 7) and now considering 2217/2221 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 436 ms. Remains : 101/108 places, 2217/2221 transitions.
[2024-06-01 05:07:00] [INFO ] Flatten gal took : 60 ms
[2024-06-01 05:07:01] [INFO ] Flatten gal took : 68 ms
[2024-06-01 05:07:01] [INFO ] Input system was already deterministic with 2217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2220
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2220
Applied a total of 4 rules in 17 ms. Remains 105 /108 variables (removed 3) and now considering 2220/2221 (removed 1) transitions.
Running 2217 sub problems to find dead transitions.
[2024-06-01 05:07:01] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-06-01 05:07:01] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:07:01] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 05:07:23] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 56652ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 56682ms
Finished structural reductions in LTL mode , in 1 iterations and 56705 ms. Remains : 105/108 places, 2220/2221 transitions.
[2024-06-01 05:07:57] [INFO ] Flatten gal took : 62 ms
[2024-06-01 05:07:58] [INFO ] Flatten gal took : 69 ms
[2024-06-01 05:07:58] [INFO ] Input system was already deterministic with 2220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2220
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2220
Applied a total of 4 rules in 18 ms. Remains 105 /108 variables (removed 3) and now considering 2220/2221 (removed 1) transitions.
Running 2217 sub problems to find dead transitions.
[2024-06-01 05:07:58] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
[2024-06-01 05:07:58] [INFO ] Invariant cache hit.
[2024-06-01 05:07:58] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 05:08:20] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2217/2217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2217 constraints, Known Traps: 1/1 constraints]
After SMT, in 57191ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 57216ms
Finished structural reductions in LTL mode , in 1 iterations and 57239 ms. Remains : 105/108 places, 2220/2221 transitions.
[2024-06-01 05:08:55] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:08:55] [INFO ] Flatten gal took : 69 ms
[2024-06-01 05:08:55] [INFO ] Input system was already deterministic with 2220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2221/2221 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Running 2218 sub problems to find dead transitions.
[2024-06-01 05:08:55] [INFO ] Flow matrix only has 290 transitions (discarded 1931 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:08:55] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:08:55] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-06-01 05:09:19] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 1/1 constraints]
After SMT, in 57885ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 57913ms
Finished structural reductions in LTL mode , in 1 iterations and 57927 ms. Remains : 108/108 places, 2221/2221 transitions.
[2024-06-01 05:09:53] [INFO ] Flatten gal took : 43 ms
[2024-06-01 05:09:53] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:09:53] [INFO ] Input system was already deterministic with 2221 transitions.
[2024-06-01 05:09:53] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:09:53] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:09:53] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:09:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 2221 transitions and 17134 arcs took 19 ms.
Total runtime 523346 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-V20P20N50-CTLCardinality-2024-00
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-02
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-03
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-04
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-09
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-10
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-11

BK_STOP 1717218595206

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-V20P20N50-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/660/ctl_0_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/660/ctl_1_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/660/ctl_2_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/660/ctl_3_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/660/ctl_4_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/660/ctl_5_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/660/ctl_6_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/660/ctl_7_
ctl formula name BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/660/ctl_8_
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-V20P20N50"
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-V20P20N50, 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-171620398700057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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