fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r047-tajo-171620397300017
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V20P10N10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7404.136 689326.00 1484628.00 230.50 FFFT?FTTFFTTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397300017.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 greatspnxred
Input is BridgeAndVehicles-COL-V20P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397300017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 01:23 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.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 8.7K Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:37 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 39K 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-V20P10N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716275385291

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:09:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 07:09:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:09:47] [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-05-21 07:09:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 07:09:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 654 ms
[2024-05-21 07:09:47] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2024-05-21 07:09:47] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 07:09:47] [INFO ] Skeletonized 16 HLPN properties in 3 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 41/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 07:09:49] [INFO ] Computed 4 invariants in 3 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
After SMT solving in domain Real declared 12/22 variables, and 4 constraints, problems are : Problem set: 37 solved, 0 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 37 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:09:49] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-21 07:09:49] [INFO ] Flatten gal took : 17 ms
[2024-05-21 07:09:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:09:49] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 07:09:49] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 33 ms.
[2024-05-21 07:09:49] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 15 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-05-21 07:09:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 07:09:49] [INFO ] Computed 7 invariants in 11 ms
[2024-05-21 07:09:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-21 07:09:52] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 10 ms to minimize.
[2024-05-21 07:09:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-05-21 07:09:54] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 3 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 130/198 variables, 68/78 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 22/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-05-21 07:10:01] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 101 constraints, problems are : Problem set: 42 solved, 503 unsolved in 17341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-05-21 07:10:10] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 130/198 variables, 68/80 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 22/102 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 503/605 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-05-21 07:10:22] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/606 constraints. Problems are: Problem set: 42 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 606 constraints, problems are : Problem set: 42 solved, 503 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 6/6 constraints]
After SMT, in 38865ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 38879ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-05-21 07:10:28] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-05-21 07:10:28] [INFO ] Computed 9 invariants in 8 ms
[2024-05-21 07:10:28] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 07:10:28] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 07:10:28] [INFO ] Invariant cache hit.
[2024-05-21 07:10:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 07:10:28] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 506/548 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39275 ms. Remains : 68/68 places, 506/548 transitions.
Support contains 15 out of 68 places after structural reductions.
[2024-05-21 07:10:28] [INFO ] Flatten gal took : 55 ms
[2024-05-21 07:10:29] [INFO ] Flatten gal took : 53 ms
[2024-05-21 07:10:29] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 14 out of 68 places (down from 15) after GAL structural reductions.
RANDOM walk for 40000 steps (224 resets) in 2192 ms. (18 steps per ms) remains 17/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2024-05-21 07:10:29] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 07:10:29] [INFO ] Invariant cache hit.
[2024-05-21 07:10:29] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Real declared 15/194 variables, and 4 constraints, problems are : Problem set: 17 solved, 0 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/68 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 17 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 17 atomic propositions for a total of 6 simplifications.
[2024-05-21 07:10:29] [INFO ] Flatten gal took : 27 ms
[2024-05-21 07:10:29] [INFO ] Flatten gal took : 31 ms
[2024-05-21 07:10:30] [INFO ] Input system was already deterministic with 506 transitions.
Computed a total of 51 stabilizing places and 82 stable transitions
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 14 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 07:10:30] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-21 07:10:30] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 07:10:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 07:10:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 07:10:36] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-21 07:10:36] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 95 constraints, problems are : Problem set: 0 solved, 502 unsolved in 11930 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/597 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 597 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 32981ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 32989ms
Finished structural reductions in LTL mode , in 1 iterations and 33007 ms. Remains : 65/68 places, 505/506 transitions.
[2024-05-21 07:11:03] [INFO ] Flatten gal took : 45 ms
[2024-05-21 07:11:03] [INFO ] Flatten gal took : 39 ms
[2024-05-21 07:11:03] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 14 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 07:11:03] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 07:11:03] [INFO ] Invariant cache hit.
[2024-05-21 07:11:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 07:11:05] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 502 unsolved in 8998 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/595 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 07:11:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 30091ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 30098ms
Finished structural reductions in LTL mode , in 1 iterations and 30117 ms. Remains : 65/68 places, 505/506 transitions.
[2024-05-21 07:11:33] [INFO ] Flatten gal took : 57 ms
[2024-05-21 07:11:33] [INFO ] Flatten gal took : 54 ms
[2024-05-21 07:11:33] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 07:11:33] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-05-21 07:11:33] [INFO ] Computed 9 invariants in 11 ms
[2024-05-21 07:11:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:11:36] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:11:40] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2024-05-21 07:11:40] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:11:41] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (OVERLAPS) 126/194 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 101 constraints, problems are : Problem set: 0 solved, 503 unsolved in 16724 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 503/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 37850ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 37868ms
Finished structural reductions in LTL mode , in 1 iterations and 37876 ms. Remains : 68/68 places, 506/506 transitions.
[2024-05-21 07:12:11] [INFO ] Flatten gal took : 31 ms
[2024-05-21 07:12:11] [INFO ] Flatten gal took : 50 ms
[2024-05-21 07:12:11] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 506
Applied a total of 1 rules in 4 ms. Remains 67 /68 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 07:12:11] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-05-21 07:12:11] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 07:12:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:12:14] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:12:18] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14651 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
After SMT, in 36096ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36116ms
Finished structural reductions in LTL mode , in 1 iterations and 36122 ms. Remains : 67/68 places, 506/506 transitions.
[2024-05-21 07:12:47] [INFO ] Flatten gal took : 15 ms
[2024-05-21 07:12:47] [INFO ] Flatten gal took : 15 ms
[2024-05-21 07:12:47] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 63 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 61 transition count 502
Applied a total of 10 rules in 58 ms. Remains 61 /68 variables (removed 7) and now considering 502/506 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 61/68 places, 502/506 transitions.
[2024-05-21 07:12:47] [INFO ] Flatten gal took : 12 ms
[2024-05-21 07:12:47] [INFO ] Flatten gal took : 14 ms
[2024-05-21 07:12:47] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 506
Applied a total of 1 rules in 4 ms. Remains 67 /68 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 07:12:48] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-05-21 07:12:48] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 07:12:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:12:49] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:12:53] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:12:57] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14758 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 601 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
After SMT, in 35526ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35531ms
Finished structural reductions in LTL mode , in 1 iterations and 35537 ms. Remains : 67/68 places, 506/506 transitions.
[2024-05-21 07:13:23] [INFO ] Flatten gal took : 30 ms
[2024-05-21 07:13:23] [INFO ] Flatten gal took : 40 ms
[2024-05-21 07:13:23] [INFO ] Input system was already deterministic with 506 transitions.
[2024-05-21 07:13:23] [INFO ] Flatten gal took : 33 ms
[2024-05-21 07:13:23] [INFO ] Flatten gal took : 33 ms
[2024-05-21 07:13:23] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 07:13:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 506 transitions and 3742 arcs took 21 ms.
Total runtime 216921 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V20P10N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 68
TRANSITIONS: 506
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.006s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 734
MODEL NAME: /home/mcc/execution/416/model
68 places, 506 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V20P10N10-CTLCardinality-2024-04 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716276074617

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-V20P10N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-COL-V20P10N10, 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 r047-tajo-171620397300017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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