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.r289-tajo-171654445400193.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 PolyORBLF-COL-S06J06T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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 PolyORBLF-COL-S06J06T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716856242727

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:30:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:30:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:30:44] [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-28 00:30:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:30:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2024-05-28 00:30:44] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
[2024-05-28 00:30:44] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 00:30:44] [INFO ] Skeletonized 16 HLPN properties in 6 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40012 steps (3897 resets) in 1989 ms. (20 steps per ms) remains 108/124 properties
BEST_FIRST walk for 402 steps (9 resets) in 10 ms. (36 steps per ms) remains 107/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (11 resets) in 10 ms. (36 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (9 resets) in 9 ms. (40 steps per ms) remains 104/107 properties
BEST_FIRST walk for 400 steps (9 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (20 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (20 resets) in 7 ms. (50 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (20 resets) in 11 ms. (33 steps per ms) remains 104/104 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (9 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 400 steps (9 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (9 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (10 resets) in 7 ms. (50 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (9 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 21 ms. (18 steps per ms) remains 104/104 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (9 resets) in 7 ms. (50 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 401 steps (9 resets) in 5 ms. (66 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (20 resets) in 5 ms. (67 steps per ms) remains 104/104 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (9 resets) in 8 ms. (44 steps per ms) remains 104/104 properties
[2024-05-28 00:30:45] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:30:45] [INFO ] Computed 26 invariants in 14 ms
[2024-05-28 00:30:45] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp112 is UNSAT
Problem AtomicPropp114 is UNSAT
Problem AtomicPropp120 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 93 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp106 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 7/13 constraints. Problems are: Problem set: 26 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 26 solved, 78 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp110 is UNSAT
Problem AtomicPropp111 is UNSAT
Problem AtomicPropp113 is UNSAT
Problem AtomicPropp117 is UNSAT
Problem AtomicPropp119 is UNSAT
Problem AtomicPropp123 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/78 variables, 5/18 constraints. Problems are: Problem set: 71 solved, 33 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp118 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 4/22 constraints. Problems are: Problem set: 82 solved, 22 unsolved
[2024-05-28 00:30:46] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 11 ms to minimize.
Problem AtomicPropp121 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/23 constraints. Problems are: Problem set: 83 solved, 21 unsolved
[2024-05-28 00:30:47] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/24 constraints. Problems are: Problem set: 83 solved, 21 unsolved
[2024-05-28 00:30:47] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/25 constraints. Problems are: Problem set: 83 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 83 solved, 21 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp116 is UNSAT
At refinement iteration 9 (OVERLAPS) 3/81 variables, 4/29 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/110 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/118 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 89 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 118 constraints, problems are : Problem set: 89 solved, 15 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 89 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/2 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 33/64 variables, 9/11 constraints. Problems are: Problem set: 89 solved, 15 unsolved
[2024-05-28 00:30:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/12 constraints. Problems are: Problem set: 89 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 89 solved, 15 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 6 (OVERLAPS) 16/80 variables, 14/26 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 3/29 constraints. Problems are: Problem set: 90 solved, 14 unsolved
[2024-05-28 00:30:48] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:30:48] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/31 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/31 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/81 variables, 1/32 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/32 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 64/145 variables, 81/113 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 8/121 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 14/135 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/135 constraints. Problems are: Problem set: 90 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/135 constraints. Problems are: Problem set: 90 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 135 constraints, problems are : Problem set: 90 solved, 14 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 14/104 constraints, Known Traps: 6/6 constraints]
After SMT, in 3316ms problems are : Problem set: 90 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 13 properties in 1088 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 80 transition count 57
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 35 place count 63 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 63 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 61 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 61 transition count 46
Applied a total of 40 rules in 34 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
Running 45 sub problems to find dead transitions.
[2024-05-28 00:30:50] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2024-05-28 00:30:50] [INFO ] Computed 25 invariants in 1 ms
[2024-05-28 00:30:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 00:30:51] [INFO ] Deduced a trap composed of 3 places in 797 ms of which 0 ms to minimize.
[2024-05-28 00:30:51] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 00:30:51] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 45/106 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 8/97 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 00:30:51] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 98 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1945 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 00:30:52] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:30:52] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 00:30:52] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 00:30:52] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 00:30:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 00:30:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 45/106 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 45/149 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-28 00:30:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 0/106 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 150 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2096 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 11/11 constraints]
After SMT, in 4072ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 4073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4121 ms. Remains : 61/81 places, 46/65 transitions.
RANDOM walk for 40006 steps (4355 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1680 steps (5 resets) in 8 ms. (186 steps per ms) remains 0/1 properties
Successfully simplified 90 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:30:54] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-28 00:30:54] [INFO ] Flatten gal took : 41 ms
[2024-05-28 00:30:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:30:54] [INFO ] Flatten gal took : 8 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 00:30:54] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 260 ms.
[2024-05-28 00:30:54] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 274 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Applied a total of 6 rules in 95 ms. Remains 500 /506 variables (removed 6) and now considering 1774/1774 (removed 0) transitions.
Running 1768 sub problems to find dead transitions.
[2024-05-28 00:30:55] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 500 cols
[2024-05-28 00:30:55] [INFO ] Computed 48 invariants in 76 ms
[2024-05-28 00:30:55] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 00:31:23] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:31:23] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:31:23] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:31:24] [INFO ] Deduced a trap composed of 248 places in 337 ms of which 3 ms to minimize.
[2024-05-28 00:31:24] [INFO ] Deduced a trap composed of 82 places in 306 ms of which 16 ms to minimize.
[2024-05-28 00:31:25] [INFO ] Deduced a trap composed of 110 places in 302 ms of which 2 ms to minimize.
[2024-05-28 00:31:25] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:31:26] [INFO ] Deduced a trap composed of 265 places in 292 ms of which 3 ms to minimize.
[2024-05-28 00:31:27] [INFO ] Deduced a trap composed of 284 places in 379 ms of which 6 ms to minimize.
[2024-05-28 00:31:27] [INFO ] Deduced a trap composed of 268 places in 340 ms of which 3 ms to minimize.
[2024-05-28 00:31:28] [INFO ] Deduced a trap composed of 276 places in 444 ms of which 3 ms to minimize.
[2024-05-28 00:31:28] [INFO ] Deduced a trap composed of 255 places in 425 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2250 variables, and 54 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 00:31:43] [INFO ] Deduced a trap composed of 226 places in 316 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/2250 variables, and 55 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 13/13 constraints]
After SMT, in 57212ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 57247ms
[2024-05-28 00:31:52] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 00:31:52] [INFO ] Invariant cache hit.
[2024-05-28 00:31:52] [INFO ] Implicit Places using invariants in 305 ms returned [398, 399, 400, 401]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 321 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 496/506 places, 1774/1774 transitions.
Applied a total of 0 rules in 25 ms. Remains 496 /496 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57697 ms. Remains : 496/506 places, 1774/1774 transitions.
Support contains 274 out of 496 places after structural reductions.
[2024-05-28 00:31:52] [INFO ] Flatten gal took : 252 ms
[2024-05-28 00:31:53] [INFO ] Flatten gal took : 344 ms
[2024-05-28 00:31:53] [INFO ] Input system was already deterministic with 1774 transitions.
RANDOM walk for 40000 steps (171 resets) in 1534 ms. (26 steps per ms) remains 26/38 properties
BEST_FIRST walk for 4003 steps (15 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (20 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (12 resets) in 80 ms. (49 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 74 ms. (53 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (14 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (12 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (10 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (11 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (9 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (16 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (16 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 46 ms. (85 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (15 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (112 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
[2024-05-28 00:31:54] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 496 cols
[2024-05-28 00:31:54] [INFO ] Computed 44 invariants in 59 ms
[2024-05-28 00:31:54] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 2 (OVERLAPS) 97/311 variables, 15/16 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Real declared 496/2246 variables, and 44 constraints, problems are : Problem set: 25 solved, 0 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/496 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 25 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 25 atomic propositions for a total of 3 simplifications.
[2024-05-28 00:31:55] [INFO ] Flatten gal took : 230 ms
[2024-05-28 00:31:56] [INFO ] Flatten gal took : 205 ms
[2024-05-28 00:31:56] [INFO ] Input system was already deterministic with 1774 transitions.
Support contains 110 out of 496 places (down from 127) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 1774/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 492 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 492 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 488 transition count 1766
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 488 transition count 1766
Applied a total of 16 rules in 77 ms. Remains 488 /496 variables (removed 8) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 00:31:56] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 488 cols
[2024-05-28 00:31:56] [INFO ] Computed 44 invariants in 86 ms
[2024-05-28 00:31:56] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 00:32:25] [INFO ] Deduced a trap composed of 203 places in 146 ms of which 2 ms to minimize.
[2024-05-28 00:32:26] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:32:26] [INFO ] Deduced a trap composed of 205 places in 135 ms of which 2 ms to minimize.
[2024-05-28 00:32:26] [INFO ] Deduced a trap composed of 202 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2230 variables, and 37 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 00:32:35] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2230 variables, and 38 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 5/5 constraints]
After SMT, in 57027ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 57058ms
Finished structural reductions in LTL mode , in 1 iterations and 57154 ms. Remains : 488/496 places, 1766/1774 transitions.
[2024-05-28 00:32:53] [INFO ] Flatten gal took : 75 ms
[2024-05-28 00:32:54] [INFO ] Flatten gal took : 78 ms
[2024-05-28 00:32:54] [INFO ] Input system was already deterministic with 1766 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 496/496 places, 1774/1774 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 496 transition count 1754
Reduce places removed 20 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 28 rules applied. Total rules applied 48 place count 476 transition count 1746
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 56 place count 468 transition count 1746
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 56 place count 468 transition count 1690
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 168 place count 412 transition count 1690
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 408 transition count 1686
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 408 transition count 1686
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 14 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 240 place count 376 transition count 1654
Applied a total of 240 rules in 271 ms. Remains 376 /496 variables (removed 120) and now considering 1654/1774 (removed 120) transitions.
Running 1648 sub problems to find dead transitions.
[2024-05-28 00:32:54] [INFO ] Flow matrix only has 1630 transitions (discarded 24 similar events)
// Phase 1: matrix 1630 rows 376 cols
[2024-05-28 00:32:54] [INFO ] Computed 44 invariants in 58 ms
[2024-05-28 00:32:54] [INFO ] State equation strengthened by 112 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
SMT process timed out in 37049ms, After SMT, problems are : Problem set: 0 solved, 1648 unsolved
Search for dead transitions found 0 dead transitions in 37094ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 37369 ms. Remains : 376/496 places, 1654/1774 transitions.
[2024-05-28 00:33:31] [INFO ] Flatten gal took : 107 ms
[2024-05-28 00:33:31] [INFO ] Flatten gal took : 96 ms
[2024-05-28 00:33:32] [INFO ] Input system was already deterministic with 1654 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 496/496 places, 1774/1774 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 496 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 460 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 72 place count 460 transition count 1682
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 184 place count 404 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 400 transition count 1678
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 400 transition count 1678
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 272 place count 360 transition count 1638
Applied a total of 272 rules in 491 ms. Remains 360 /496 variables (removed 136) and now considering 1638/1774 (removed 136) transitions.
Running 1632 sub problems to find dead transitions.
[2024-05-28 00:33:32] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
// Phase 1: matrix 1614 rows 360 cols
[2024-05-28 00:33:32] [INFO ] Computed 44 invariants in 32 ms
[2024-05-28 00:33:32] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J06T04

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.325

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 506
TRANSITIONS: 7154
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 59824
UNFOLDING TIME: 0.956

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.235
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.767
OK.
----------------------------------------------------------------------
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: 739
MODEL NAME: /home/mcc/execution/model
506 places, 7154 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="PolyORBLF-COL-S06J06T04"
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 PolyORBLF-COL-S06J06T04, 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 r289-tajo-171654445400193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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