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

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 407379.00 0.00 0.00 TTFFTTF?T?F????T normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.8K Apr 13 00:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 00:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:54 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.3K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 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 45K 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-V80P50N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716325290335

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-21 21:01:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:01:31] [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 21:01:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 21:01:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2024-05-21 21:01:32] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
[2024-05-21 21:01:32] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-05-21 21:01:32] [INFO ] Skeletonized 16 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.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.
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-04 TRUE 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.0 ms
RANDOM walk for 40000 steps (8 resets) in 1855 ms. (21 steps per ms) remains 15/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 21:01:33] [INFO ] Computed 4 invariants in 5 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp39 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 7 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/12 variables, 3/4 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 10 solved, 5 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 5/21 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 21 constraints, problems are : Problem set: 10 solved, 5 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 5/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 10 solved, 5 unsolved
Finished Parikh walk after 2875 steps, including 15 resets, run visited all 1 properties in 5 ms. (steps per millisecond=575 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 449 ms.
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
[2024-05-21 21:01:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 21:01:34] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:01:34] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:01:34] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] 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 21:01:34] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 167 ms.
[2024-05-21 21:01:34] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 14 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 3728
Applied a total of 1 rules in 132 ms. Remains 197 /198 variables (removed 1) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:01:34] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 197 cols
[2024-05-21 21:01:34] [INFO ] Computed 6 invariants in 46 ms
[2024-05-21 21:01:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:02:41] [INFO ] Deduced a trap composed of 5 places in 455 ms of which 8 ms to minimize.
SMT process timed out in 66372ms, After SMT, problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 66469ms
[2024-05-21 21:02:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:02:41] [INFO ] Invariant cache hit.
[2024-05-21 21:02:41] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-21 21:02:41] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:02:41] [INFO ] Invariant cache hit.
[2024-05-21 21:02:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:02:42] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
Running 3725 sub problems to find dead transitions.
[2024-05-21 21:02:42] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:02:42] [INFO ] Invariant cache hit.
[2024-05-21 21:02:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 21:03:56] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/607 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/197 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/607 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/197 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 113429ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 113472ms
Starting structural reductions in LTL mode, iteration 1 : 197/198 places, 3728/3728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182027 ms. Remains : 197/198 places, 3728/3728 transitions.
Support contains 14 out of 197 places after structural reductions.
[2024-05-21 21:04:36] [INFO ] Flatten gal took : 248 ms
[2024-05-21 21:04:36] [INFO ] Flatten gal took : 239 ms
[2024-05-21 21:04:37] [INFO ] Input system was already deterministic with 3728 transitions.
RANDOM walk for 40000 steps (56 resets) in 2946 ms. (13 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40004 steps (19 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (24 resets) in 361 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
[2024-05-21 21:04:38] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 21:04:38] [INFO ] Invariant cache hit.
[2024-05-21 21:04:38] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/12 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 329/341 variables, 12/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 21/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 265/606 variables, 184/220 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 3/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 21/244 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/607 variables, 1/245 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/245 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/607 variables, 0/245 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 245 constraints, problems are : Problem set: 2 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 197/197 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/249 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 334/583 variables, 167/175 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 2/177 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 42/219 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 1/220 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/585 variables, 1/221 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 2/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/607 variables, 22/245 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 1/246 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/607 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/607 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 607/607 variables, and 246 constraints, problems are : Problem set: 2 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 197/197 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 1961 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 916 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 21:04:40] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 21:04:40] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 21:04:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 21:05:54] [INFO ] Deduced a trap composed of 5 places in 512 ms of which 2 ms to minimize.
SMT process timed out in 74341ms, After SMT, problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 74384ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75309 ms. Remains : 195/197 places, 3727/3728 transitions.
RANDOM walk for 40000 steps (64 resets) in 950 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (24 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 139970 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 139970 steps, saw 41185 distinct states, run finished after 3017 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-21 21:05:58] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 21:05:58] [INFO ] Invariant cache hit.
[2024-05-21 21:05:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/291 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/295 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 145/440 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 163/603 variables, 82/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/603 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/604 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/291 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/295 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 145/440 variables, 26/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 21/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 163/603 variables, 82/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/603 variables, 21/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/603 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/604 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/604 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/604 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 243 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 703 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 547 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 21:06:01] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 21:06:01] [INFO ] Invariant cache hit.
[2024-05-21 21:06:02] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-21 21:06:02] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 21:06:02] [INFO ] Invariant cache hit.
[2024-05-21 21:06:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:06:04] [INFO ] Implicit Places using invariants and state equation in 1972 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2790 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 674 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4011 ms. Remains : 193/195 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 1165 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (24 resets) in 394 ms. (101 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 150907 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 150907 steps, saw 44042 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-21 21:06:08] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2024-05-21 21:06:08] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 21:06:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/294 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:06:08] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 145/439 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 162/601 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 21/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/602 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 145/439 variables, 26/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 21/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 162/601 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/602 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2068ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 740 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 741 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 708 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 21:06:11] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 21:06:11] [INFO ] Invariant cache hit.
[2024-05-21 21:06:12] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-21 21:06:12] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 21:06:12] [INFO ] Invariant cache hit.
[2024-05-21 21:06:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:06:13] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2024-05-21 21:06:14] [INFO ] Redundant transitions in 293 ms returned []
Running 3724 sub problems to find dead transitions.
[2024-05-21 21:06:14] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 21:06:14] [INFO ] Invariant cache hit.
[2024-05-21 21:06:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 21:07:26] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 111962ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 112013ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115140 ms. Remains : 193/193 places, 3727/3727 transitions.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
[2024-05-21 21:08:06] [INFO ] Flatten gal took : 180 ms
[2024-05-21 21:08:06] [INFO ] Flatten gal took : 175 ms
[2024-05-21 21:08:07] [INFO ] Input system was already deterministic with 3728 transitions.
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Graph (complete) has 6009 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 191 transition count 3724
Applied a total of 10 rules in 795 ms. Remains 191 /197 variables (removed 6) and now considering 3724/3728 (removed 4) transitions.
[2024-05-21 21:08:07] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2024-05-21 21:08:07] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 21:08:08] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-21 21:08:08] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 21:08:08] [INFO ] Invariant cache hit.
[2024-05-21 21:08:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:08:09] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1618 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 190/197 places, 3724/3728 transitions.
Applied a total of 0 rules in 538 ms. Remains 190 /190 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2952 ms. Remains : 190/197 places, 3724/3728 transitions.
[2024-05-21 21:08:10] [INFO ] Flatten gal took : 89 ms
[2024-05-21 21:08:10] [INFO ] Flatten gal took : 108 ms
[2024-05-21 21:08:10] [INFO ] Input system was already deterministic with 3724 transitions.
RANDOM walk for 519 steps (0 resets) in 13 ms. (37 steps per ms) remains 0/1 properties
FORMULA BridgeAndVehicles-COL-V80P50N20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 21:08:10] [INFO ] Flatten gal took : 144 ms
[2024-05-21 21:08:11] [INFO ] Flatten gal took : 136 ms
[2024-05-21 21:08:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14397941869262029076.gal : 122 ms
[2024-05-21 21:08:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3092407939706567331.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14397941869262029076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3092407939706567331.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 3728/3728 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 3728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 55 ms. Remains 195 /197 variables (removed 2) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 21:08:11] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 21:08:11] [INFO ] Computed 5 invariants in 15 ms
[2024-05-21 21:08:11] [INFO ] State equation strengthened by 42 read => feed constraints.

BK_STOP 1716325697714

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V80P50N20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BridgeAndVehicles-COL-V80P50N20, 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 r048-tajo-171620398900145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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