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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.7K Apr 13 00:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 00:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 00:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 00:33 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.4K 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.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 01:08 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 42K 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-V50P20N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218199454

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-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:03:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:03:21] [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:03:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:03:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 746 ms
[2024-06-01 05:03:21] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:03:21] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2024-06-01 05:03:21] [INFO ] Skeletonized 15 HLPN properties in 2 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.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.
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
RANDOM walk for 40000 steps (8 resets) in 2922 ms. (13 steps per ms) remains 38/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 05:03:23] [INFO ] Computed 4 invariants in 5 ms
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 31 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 31 solved, 7 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 3/4 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 7/23 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/23 constraints. Problems are: Problem set: 31 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/23 constraints. Problems are: Problem set: 31 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 23 constraints, problems are : Problem set: 31 solved, 7 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 507ms problems are : Problem set: 31 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 37 ms.
Successfully simplified 31 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:03:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 05:03:23] [INFO ] Flatten gal took : 14 ms
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:03:23] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:03:23] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 69 ms.
[2024-06-01 05:03:23] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 15 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 45 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-06-01 05:03:24] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-06-01 05:03:24] [INFO ] Computed 7 invariants in 19 ms
[2024-06-01 05:03:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-06-01 05:03:36] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 8 ms to minimize.
[2024-06-01 05:03:42] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-06-01 05:03:46] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
[2024-06-01 05:04:03] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 11 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 4/4 constraints]
After SMT, in 46829ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 46865ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2024-06-01 05:04:10] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-06-01 05:04:10] [INFO ] Computed 7 invariants in 5 ms
[2024-06-01 05:04:11] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 05:04:11] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:11] [INFO ] Invariant cache hit.
[2024-06-01 05:04:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:04:11] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47582 ms. Remains : 128/128 places, 1228/1328 transitions.
Support contains 15 out of 128 places after structural reductions.
[2024-06-01 05:04:11] [INFO ] Flatten gal took : 178 ms
[2024-06-01 05:04:11] [INFO ] Flatten gal took : 139 ms
[2024-06-01 05:04:12] [INFO ] Input system was already deterministic with 1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 2158 ms. (18 steps per ms) remains 14/24 properties
BEST_FIRST walk for 40004 steps (32 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (36 resets) in 258 ms. (154 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (32 resets) in 186 ms. (213 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (33 resets) in 359 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (36 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (32 resets) in 251 ms. (158 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (32 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (33 resets) in 314 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (32 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (40 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (36 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (32 resets) in 179 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (39 resets) in 196 ms. (203 steps per ms) remains 14/14 properties
[2024-06-01 05:04:13] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:13] [INFO ] Invariant cache hit.
[2024-06-01 05:04:13] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
All remaining problems are real, not stopping.
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 AtomicPropp1 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 248/263 variables, 15/19 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 20/39 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 113/376 variables, 113/152 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/155 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 11 solved, 3 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 248/263 variables, 15/19 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 20/39 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 113/376 variables, 113/152 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 3/155 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/158 constraints. Problems are: Problem set: 11 solved, 3 unsolved
[2024-06-01 05:04:14] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/159 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/159 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/159 constraints. Problems are: Problem set: 11 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 159 constraints, problems are : Problem set: 11 solved, 3 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 1265ms problems are : Problem set: 11 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 586 ms.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 133 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:04:15] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:15] [INFO ] Invariant cache hit.
[2024-06-01 05:04:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:04:26] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
SMT process timed out in 26008ms, After SMT, problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 26022ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26158 ms. Remains : 128/128 places, 1228/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 434 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40008 steps (32 resets) in 126 ms. (315 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40005 steps (32 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 290297 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 3
Probabilistic random walk after 290297 steps, saw 79690 distinct states, run finished after 3005 ms. (steps per millisecond=96 ) properties seen :0
[2024-06-01 05:04:45] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:45] [INFO ] Invariant cache hit.
[2024-06-01 05:04:45] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 248/263 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 113/376 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 248/263 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 113/376 variables, 113/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 05:04:45] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1086ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 649 ms.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 69 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 128/128 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 80 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-06-01 05:04:47] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:47] [INFO ] Invariant cache hit.
[2024-06-01 05:04:47] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-01 05:04:47] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:47] [INFO ] Invariant cache hit.
[2024-06-01 05:04:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:04:48] [INFO ] Implicit Places using invariants and state equation in 766 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1023 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 55 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1158 ms. Remains : 126/128 places, 1228/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 433 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (32 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 345867 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 3
Probabilistic random walk after 345867 steps, saw 94787 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 05:04:51] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-06-01 05:04:51] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 05:04:51] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 146/157 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 215/372 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/374 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 151 constraints, problems are : Problem set: 0 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 146/157 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 215/372 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 05:04:52] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/374 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1172 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1373ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1472 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 73 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 126/126 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 76 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-06-01 05:04:54] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:54] [INFO ] Invariant cache hit.
[2024-06-01 05:04:54] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 05:04:54] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:54] [INFO ] Invariant cache hit.
[2024-06-01 05:04:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:04:55] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2024-06-01 05:04:55] [INFO ] Redundant transitions in 72 ms returned []
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:04:55] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-06-01 05:04:55] [INFO ] Invariant cache hit.
[2024-06-01 05:04:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:05:05] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/372 variables, 124/130 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
[2024-06-01 05:05:28] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2024-06-01 05:05:29] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/374 variables, and 152 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 248/372 variables, 124/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 1119/1271 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/374 variables, and 1271 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1119/1225 constraints, Known Traps: 3/3 constraints]
After SMT, in 65635ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 65647ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 1226/1228 transitions.
Applied a total of 0 rules in 61 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-06-01 05:06:01] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66978 ms. Remains : 126/126 places, 1226/1228 transitions.
Successfully simplified 11 atomic propositions for a total of 8 simplifications.
[2024-06-01 05:06:01] [INFO ] Flatten gal took : 50 ms
[2024-06-01 05:06:01] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:06:01] [INFO ] Input system was already deterministic with 1228 transitions.
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 18 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:06:01] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:06:01] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:06:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:06:11] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 26076ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 26094ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26126 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:06:27] [INFO ] Flatten gal took : 45 ms
[2024-06-01 05:06:27] [INFO ] Flatten gal took : 45 ms
[2024-06-01 05:06:27] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:06:28] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-06-01 05:06:28] [INFO ] Computed 7 invariants in 8 ms
[2024-06-01 05:06:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:06:37] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/376 variables, 128/136 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 20/156 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1379 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21851 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47356ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47374ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47393 ms. Remains : 128/128 places, 1226/1228 transitions.
[2024-06-01 05:07:15] [INFO ] Flatten gal took : 33 ms
[2024-06-01 05:07:15] [INFO ] Flatten gal took : 37 ms
[2024-06-01 05:07:15] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 14 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:07:15] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:07:15] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:07:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:07:23] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 1222/1373 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 44770ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 44788ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44819 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:08:00] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:08:00] [INFO ] Flatten gal took : 67 ms
[2024-06-01 05:08:00] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 17 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:08:00] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-06-01 05:08:00] [INFO ] Invariant cache hit.
[2024-06-01 05:08:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:08:10] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 26030ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 26051ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26080 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:08:26] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:08:26] [INFO ] Flatten gal took : 55 ms
[2024-06-01 05:08:27] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 14 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:08:27] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-06-01 05:08:27] [INFO ] Invariant cache hit.
[2024-06-01 05:08:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:08:36] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 25145ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 25162ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25184 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:08:52] [INFO ] Flatten gal took : 27 ms
[2024-06-01 05:08:52] [INFO ] Flatten gal took : 31 ms
[2024-06-01 05:08:52] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 9 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:08:52] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-06-01 05:08:52] [INFO ] Invariant cache hit.
[2024-06-01 05:08:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:09:01] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21710 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46643ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46654ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46671 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:09:39] [INFO ] Flatten gal took : 28 ms
[2024-06-01 05:09:39] [INFO ] Flatten gal took : 31 ms
[2024-06-01 05:09:39] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 235 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:09:39] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:09:39] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:09:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:09:48] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21693 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 47417ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 47430ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 73 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47743 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:10:26] [INFO ] Flatten gal took : 27 ms
[2024-06-01 05:10:26] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:10:27] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-06-01 05:10:27] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-06-01 05:10:27] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 05:10:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-06-01 05:10:37] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/376 variables, 128/136 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 20/156 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 1379 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21812 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 48185ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 48198ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48214 ms. Remains : 128/128 places, 1226/1228 transitions.
[2024-06-01 05:11:15] [INFO ] Flatten gal took : 28 ms
[2024-06-01 05:11:15] [INFO ] Flatten gal took : 32 ms
[2024-06-01 05:11:15] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 11 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 05:11:15] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-06-01 05:11:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 05:11:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 05:11:25] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
SMT process timed out in 25662ms, After SMT, problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 25675ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25698 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-06-01 05:11:41] [INFO ] Flatten gal took : 28 ms
[2024-06-01 05:11:41] [INFO ] Flatten gal took : 32 ms
[2024-06-01 05:11:41] [INFO ] Input system was already deterministic with 1225 transitions.
[2024-06-01 05:11:41] [INFO ] Flatten gal took : 31 ms
[2024-06-01 05:11:41] [INFO ] Flatten gal took : 72 ms
[2024-06-01 05:11:41] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 05:11:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1228 transitions and 9210 arcs took 33 ms.
Total runtime 500545 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-V50P20N10-CTLCardinality-2024-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-02
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-03
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-04
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-09
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-10
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-11
Could not compute solution for formula : BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-15

BK_STOP 1717218701909

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-V50P20N10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/725/ctl_0_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/725/ctl_1_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/725/ctl_2_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/725/ctl_3_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/725/ctl_4_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/725/ctl_5_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/725/ctl_6_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/725/ctl_7_
ctl formula name BridgeAndVehicles-COL-V50P20N10-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/725/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-V50P20N10"
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-V50P20N10, 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-171620398700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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